LEADER 05495nam 22007455 450 001 9910484002603321 005 20230223093538.0 010 $a3-642-38527-3 024 7 $a10.1007/978-3-642-38527-8 035 $a(CKB)3280000000007653 035 $a(DE-He213)978-3-642-38527-8 035 $a(SSID)ssj0000904571 035 $a(PQKBManifestationID)11530004 035 $a(PQKBTitleCode)TC0000904571 035 $a(PQKBWorkID)10924020 035 $a(PQKB)11413849 035 $a(MiAaPQ)EBC3093405 035 $a(PPN)170492273 035 $a(EXLCZ)993280000000007653 100 $a20130509d2013 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aExperimental Algorithms $e12th International Symposium, SEA 2013, Rome, Italy, June 5-7, 2013, Proceedings /$fedited by Vincenzo Bonifaci, Camil Demetrescu, Alberto Marchetti-Spaccamela 205 $a1st ed. 2013. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2013. 215 $a1 online resource (XII, 416 p. 81 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7933 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-38526-5 327 $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-Bound Algorithms 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. 330 $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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7933 606 $aAlgorithms 606 $aArtificial intelligence?Data processing 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aArtificial intelligence 606 $aAlgorithms 606 $aData Science 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aArtificial Intelligence 615 0$aAlgorithms. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aArtificial intelligence. 615 14$aAlgorithms. 615 24$aData Science. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aArtificial Intelligence. 676 $a005.1 702 $aBonifaci$b Vincenzo$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aDemetrescu$b Camil$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMarchetti-Spaccamela$b Alberto$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a9910484002603321 996 $aExperimental Algorithms$9772547 997 $aUNINA