Algorithm Theory -- SWAT 2014: 14th Scandinavian Symposium and Workshops, SWAT 2014, Copenhagen, Denmark, July 2-4, 2014. Proceedings

Algorithm Theory -- SWAT 2014: 14th Scandinavian Symposium and Workshops, SWAT 2014, Copenhagen, Denmark, July 2-4, 2014. Proceedings

Paperback(2014)

$79.99
Choose Expedited Shipping at checkout for guaranteed delivery by Thursday, March 28

Product Details

ISBN-13: 9783319084039
Publisher: Springer International Publishing
Publication date: 05/29/2014
Series: Lecture Notes in Computer Science , #8503
Edition description: 2014
Pages: 394
Product dimensions: 6.10(w) x 9.25(h) x 0.03(d)

Table of Contents

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.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews