LEADER 04429nam 22006855 450 001 996199994003316 005 20230329211213.0 010 $a3-319-08404-6 024 7 $a10.1007/978-3-319-08404-6 035 $a(CKB)3710000000143884 035 $a(SSID)ssj0001274573 035 $a(PQKBManifestationID)11858390 035 $a(PQKBTitleCode)TC0001274573 035 $a(PQKBWorkID)11342344 035 $a(PQKB)10714929 035 $a(DE-He213)978-3-319-08404-6 035 $a(MiAaPQ)EBC3093381 035 $a(PPN)17976649X 035 $a(EXLCZ)993710000000143884 100 $a20140625d2014 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithm Theory -- SWAT 2014$b[electronic resource] $e14th Scandinavian Symposium and Workshops, SWAT 2014, Copenhagen, Denmark, July 2-4, 2014. Proceedings /$fedited by Inge Li Gørtz, R. Ravi 205 $a1st ed. 2014. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2014. 215 $a1 online resource (XX, 394 p. 39 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8503 300 $aInternational conference proceedings. 311 $a3-319-08403-8 320 $aIncludes bibliographical references and author index. 327 $aOnline 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8503 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence?Data processing 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence?Data processing. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 676 $a005.1 702 $aGørtz$b Inge Li$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRavi$b R$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996199994003316 996 $aAlgorithm Theory -- SWAT 2014$92587614 997 $aUNISA