000 05215nam a22006255i 4500
001 978-3-642-38527-8
003 DE-He213
005 20240423125927.0
007 cr nn 008mamaa
008 130509s2013 gw | s |||| 0|eng d
020 _a9783642385278
_9978-3-642-38527-8
024 7 _a10.1007/978-3-642-38527-8
_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 _aExperimental Algorithms
_h[electronic resource] :
_b12th International Symposium, SEA 2013, Rome, Italy, June 5-7, 2013, Proceedings /
_cedited by Vincenzo Bonifaci, Camil Demetrescu, Alberto Marchetti-Spaccamela.
250 _a1st ed. 2013.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _aXII, 416 p. 81 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 ;
_v7933
505 0 _aAlgorithms and Linear Programming Relaxations for Scheduling Unrelated Parallel Machines.- The Hub Labeling Algorithm.- Design of Practical Succinct Data Structures for Large Data Collections.- Hub Label Compression.- Faster Customization of Road Networks.- Intriguingly Simple and Fast Transit Routing.- Transit Node Routing Reconsidered.- A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions.- Computational Aspects of Ordered Integer Partition with Upper Bounds.- Hypergraph Transversal Computation with Binary Decision Diagrams.- Efficient Counting of Maximal Independent Sets in Sparse Graphs -- An Edge Quadtree for External Memory.- Branchless Search Programs.- Lightweight Lempel-Ziv Parsing.- Space-Efficient, High-Performance Rank and Select Structures on Uncompressed Bit Sequences -- Think Locally, Act Globally: Highly Balanced Graph Partitioning.- Evaluation of ILP-Based Approaches for Partitioning into Colorful Components -- Finding Modules in Networks with Non-modular Regions.- Telling Stories Fast: Via Linear-Time Delay Pitch Enumeration -- Undercover Branching.- Quadratic Outer Approximation for Convex Integer Programming with Box Constraints -- Separable Non-convex Underestimators for Binary Quadratic Programming.- Hybrid SDP Bounding Procedure.- Computing Multimodal Journeys in Practice.- Efficient Computation of Jogging Routes.- Dominator Certification and Independent Spanning Trees: An Experimental Study.- Novel Techniques for Automorphism Group Computation.- Blinking Molecule Tracking.- The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm.- An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number.- In-Out Separation and Column Generation Stabilization by Dual Price Smoothing.- Energy Minimization via a Primal-Dual Algorithm for a Convex Program -- Reoptimization in Branch-and-BoundAlgorithms with an Application to Elevator Control.- Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows.- Finding Robust Solutions for the Stochastic Job Shop Scheduling Problem by Including Simulation in Local Search.
520 _aThis book constitutes the refereed proceedings of the 12th International Symposium on Experimental Algorithms, SEA 2013, held in Rome, Italy, in June 2013. The 32 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 73 submissions. The papers are organized in topical sections on transportation networks and graph algorithms, combinatorics and enumeration, data structures and compression, network partitioning and bioinformatics, mathematical programming, geometry and optimization, and scheduling and local search.
650 0 _aAlgorithms.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aNumerical analysis.
650 0 _aArtificial intelligence.
650 1 4 _aAlgorithms.
650 2 4 _aData Science.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aNumerical Analysis.
650 2 4 _aArtificial Intelligence.
700 1 _aBonifaci, Vincenzo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aDemetrescu, Camil.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMarchetti-Spaccamela, Alberto.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642385261
776 0 8 _iPrinted edition:
_z9783642385285
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v7933
856 4 0 _uhttps://doi.org/10.1007/978-3-642-38527-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c183188
_d183188