Buch, Englisch, 394 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 6263 g
14th Scandinavian Symposium and Workshops, SWAT 2014, Copenhagen, Denmark, July 2-4, 2014. Proceedings
Buch, Englisch, 394 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 6263 g
Reihe: Theoretical Computer Science and General Issues
ISBN: 978-3-319-08403-9
Verlag: Springer
This book constitutes the refereed proceedings of the 14th International Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2014, held in Copenhagen, Denmark, in July 2014. The 33 papers were carefully reviewed and selected from a total of 134 submissions. The papers present original research and cover a wide range of topics in the field of design and analysis of algorithms and data structures including but not limited to approximation algorithms, parameterized algorithms, computational biology, computational geometry and topology, distributed algorithms, external-memory algorithms, exponential algorithms, graph algorithms, online algorithms, optimization algorithms, randomized algorithms, streaming algorithms, string algorithms, sublinear algorithms and algorithmic game theory.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
Online Makespan Minimization with Parallel Schedules.- Expected Linear Time Sorting for Word Size O (log2 n log log n ).- Amortized Analysis of Smooth Quadtrees in All Dimensions.- New Approximability Results for the Robust k -Median Problem.- Approximating the Revenue Maximization Problem with Sharp Demands.- Reconfiguring Independent Sets in Claw-Free Graphs.- Competitive Online Routing on Delaunay Triangulations.- Optimal Planar Orthogonal Skyline Counting Queries.- B-slack Trees: Space Efficient B-Trees.- Approximately Minwise Independence with Twisted Tabulation.- Colorful Bin Packing.- Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques.- Win-Win Kernelization for Degree Sequence Completion Problems.- On Matchings and b -Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem.- Covering Problems in Edge- and Node-Weighted Graphs.- Colored Range Searching in Linear Space.- Fast Dynamic Graph Algorithms for Parameterized Problems.- Extending Partial Representations of Proper and Unit Interval Graphs.- Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams.- Approximate Counting of Matchings in (3,3)-Hypergraphs.
