000 04771nam a22005655i 4500
001 978-3-319-20086-6
003 DE-He213
005 20200420220213.0
007 cr nn 008mamaa
008 150619s2015 gw | s |||| 0|eng d
020 _a9783319200866
_9978-3-319-20086-6
024 7 _a10.1007/978-3-319-20086-6
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aExperimental Algorithms
_h[electronic resource] :
_b14th International Symposium, SEA 2015, Paris, France, June 29 - July 1, 2015, Proceedings /
_cedited by Evripidis Bampis.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _aXI, 404 p. 80 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v9125
505 0 _aData Structures -- Parallel Construction of Succinct Trees -- Tree Compression with Top Trees Revisited -- A Bulk-Parallel Priority Queue in External Memory with STXXL -- Graph Problems I -- Greedily Improving Our Own Centrality in a Network -- An Exact Algorithm for Diameters of Large Real Directed Graphs -- Graph Partitioning for Independent Sets -- Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments -- Combinatorial Optimization I -- On the Generation of Cutting Planes which Maximize the Bound Improvement -- Separation of Generic Cutting Planes in Branch-and-Price Using a Basis -- On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space -- Scheduling and Allocation -- Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors -- Station Assignment with Reallocation -- Online Knapsack of Unknown Capacity: Energy Optimization for Smartphone Communications -- Combinatorial Optimization II -- Reoptimization Techniques for MIP Solvers -- Submodular Minimization in the Context of Modern LP and MILP Methods and Solvers -- Is Nearly-linear the Same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver -- Efficient and Practical Tree Preconditioning for Solving Laplacian Systems -- Other Applications I -- Efficient Generation of Stable Planar Cages for Chemistry -- Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment -- Solving k-means on High-Dimensional Big Data -- X Contents -- Transportation Networks -- Public Transit Labeling -- On Balanced Separators in Road Networks -- SALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks -- Other Applications II -- Huffman Codes versus Augmented Non-Prefix-Free Codes -- Experimental Analysis of an Online Dictionary Matching Algorithm for Regular Expressions with Gaps -- in Bimatrix Games -- The Effect of Almost-Empty Faces on Planar Kandinsky Drawings -- Graph Problems II -- An Experimental Analysis of a Polynomial Compression for the Steiner Cycle Problem -- On the Quadratic Shortest Path Problem -- A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions.
520 _aThis book constitutes the refereed proceedings of the 14th International Symposium on Experimental Algorithms, SEA 2015, held in Paris, France, in June/July 2015. The 30 revised full papers presented were carefully reviewed and selected from 76 submissions. The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. The papers are grouped in topical sections on data structures, graph problems, combinatorial optimization, scheduling and allocation, and transportation networks.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aAlgorithms.
650 0 _aNumerical analysis.
650 0 _aComputer science
_xMathematics.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aData Structures.
650 2 4 _aNumeric Computing.
650 2 4 _aAlgorithms.
650 2 4 _aArtificial Intelligence (incl. Robotics).
700 1 _aBampis, Evripidis.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319200859
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v9125
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-20086-6
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c51406
_d51406