Algorithm Theory -- SWAT 2014, 2014 14th Scandinavian Symposium and Workshops, SWAT 2014, Copenhagen, Denmark, July 2-4, 2014. Proceedings Theoretical Computer Science and General Issues Series
Coordonnateurs : Gørtz Inge Li, Ravi R.
Online Makespan Minimization with Parallel Schedules.- Expected Linear Time Sorting for Word Size Ω(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.
Date de parution : 08-2014
Ouvrage de 394 p.
15.5x23.5 cm
Thèmes d’Algorithm Theory -- SWAT 2014 :
Mots-clés :
algorithmic game theory; aproximation algorithms; aproximation algorithms; computational biology; computational biology; concurrent tree; data structures; distributed algorithms; distributed algorithms; graph algorithms analysis; optimization algorithms; parameterized complexity and exact algorithms; parameterized complexity and exact algorithms; pattern matching; pattern matching; algorithm analysis and problem complexity