000 04233nam a22005655i 4500
001 978-3-319-08404-6
003 DE-He213
005 20240730202341.0
007 cr nn 008mamaa
008 140625s2014 sz | s |||| 0|eng d
020 _a9783319084046
_9978-3-319-08404-6
024 7 _a10.1007/978-3-319-08404-6
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aAlgorithm Theory -- SWAT 2014
_h[electronic resource] :
_b14th Scandinavian Symposium and Workshops, SWAT 2014, Copenhagen, Denmark, July 2-4, 2014. Proceedings /
_cedited by Inge Li Gørtz, R. Ravi.
250 _a1st ed. 2014.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2014.
300 _aXX, 394 p. 39 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8503
505 0 _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.
520 _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.
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aArtificial intelligence
_xData processing.
_921787
650 1 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aData Science.
_934092
700 1 _aGørtz, Inge Li.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9171025
700 1 _aRavi, R.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_91529
710 2 _aSpringerLink (Online service)
_9171026
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319084039
776 0 8 _iPrinted edition:
_z9783319084053
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8503
_9171027
856 4 0 _uhttps://doi.org/10.1007/978-3-319-08404-6
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c96973
_d96973