Ebook: Experimental Algorithms: 12th International Symposium, SEA 2013, Rome, Italy, June 5-7, 2013. Proceedings

This 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.

---

This 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.

Content:
Front Matter....Pages -
Algorithms and Linear Programming Relaxations for Scheduling Unrelated Parallel Machines....Pages 1-3
The Hub Labeling Algorithm....Pages 4-4
Design of Practical Succinct Data Structures for Large Data Collections....Pages 5-17
Hub Label Compression....Pages 18-29
Faster Customization of Road Networks....Pages 30-42
Intriguingly Simple and Fast Transit Routing....Pages 43-54
Transit Node Routing Reconsidered....Pages 55-66
A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions....Pages 67-78
Computational Aspects of Ordered Integer Partition with Upper Bounds....Pages 79-90
Hypergraph Transversal Computation with Binary Decision Diagrams....Pages 91-102
Efficient Counting of Maximal Independent Sets in Sparse Graphs....Pages 103-114
An Edge Quadtree for External Memory....Pages 115-126
Branchless Search Programs....Pages 127-138
Lightweight Lempel-Ziv Parsing....Pages 139-150
Space-Efficient, High-Performance Rank and Select Structures on Uncompressed Bit Sequences....Pages 151-163
Think Locally, Act Globally: Highly Balanced Graph Partitioning....Pages 164-175
Evaluation of ILP-Based Approaches for Partitioning into Colorful Components....Pages 176-187
Finding Modules in Networks with Non-modular Regions....Pages 188-199
Telling Stories Fast....Pages 200-211
Undercover Branching....Pages 212-223
Quadratic Outer Approximation for Convex Integer Programming with Box Constraints....Pages 224-235
Separable Non-convex Underestimators for Binary Quadratic Programming....Pages 236-247
Hybrid SDP Bounding Procedure....Pages 248-259
Computing Multimodal Journeys in Practice....Pages 260-271
Efficient Computation of Jogging Routes....Pages 272-283
Dominator Certification and Independent Spanning Trees: An Experimental Study....Pages 284-295
Novel Techniques for Automorphism Group Computation....Pages 296-307
Blinking Molecule Tracking....Pages 308-319
The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm....Pages 320-336
An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number....Pages 337-353
In-Out Separation and Column Generation Stabilization by Dual Price Smoothing....Pages 354-365
Energy Minimization via a Primal-Dual Algorithm for a Convex Program....Pages 366-377
Reoptimization in Branch-and-Bound Algorithms with an Application to Elevator Control....Pages 378-389
Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows....Pages 390-401
Finding Robust Solutions for the Stochastic Job Shop Scheduling Problem by Including Simulation in Local Search....Pages 402-413
Back Matter....Pages -

---

This 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.

Content:
Front Matter....Pages -
Algorithms and Linear Programming Relaxations for Scheduling Unrelated Parallel Machines....Pages 1-3
The Hub Labeling Algorithm....Pages 4-4
Design of Practical Succinct Data Structures for Large Data Collections....Pages 5-17
Hub Label Compression....Pages 18-29
Faster Customization of Road Networks....Pages 30-42
Intriguingly Simple and Fast Transit Routing....Pages 43-54
Transit Node Routing Reconsidered....Pages 55-66
A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions....Pages 67-78
Computational Aspects of Ordered Integer Partition with Upper Bounds....Pages 79-90
Hypergraph Transversal Computation with Binary Decision Diagrams....Pages 91-102
Efficient Counting of Maximal Independent Sets in Sparse Graphs....Pages 103-114
An Edge Quadtree for External Memory....Pages 115-126
Branchless Search Programs....Pages 127-138
Lightweight Lempel-Ziv Parsing....Pages 139-150
Space-Efficient, High-Performance Rank and Select Structures on Uncompressed Bit Sequences....Pages 151-163
Think Locally, Act Globally: Highly Balanced Graph Partitioning....Pages 164-175
Evaluation of ILP-Based Approaches for Partitioning into Colorful Components....Pages 176-187
Finding Modules in Networks with Non-modular Regions....Pages 188-199
Telling Stories Fast....Pages 200-211
Undercover Branching....Pages 212-223
Quadratic Outer Approximation for Convex Integer Programming with Box Constraints....Pages 224-235
Separable Non-convex Underestimators for Binary Quadratic Programming....Pages 236-247
Hybrid SDP Bounding Procedure....Pages 248-259
Computing Multimodal Journeys in Practice....Pages 260-271
Efficient Computation of Jogging Routes....Pages 272-283
Dominator Certification and Independent Spanning Trees: An Experimental Study....Pages 284-295
Novel Techniques for Automorphism Group Computation....Pages 296-307
Blinking Molecule Tracking....Pages 308-319
The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm....Pages 320-336
An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number....Pages 337-353
In-Out Separation and Column Generation Stabilization by Dual Price Smoothing....Pages 354-365
Energy Minimization via a Primal-Dual Algorithm for a Convex Program....Pages 366-377
Reoptimization in Branch-and-Bound Algorithms with an Application to Elevator Control....Pages 378-389
Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows....Pages 390-401
Finding Robust Solutions for the Stochastic Job Shop Scheduling Problem by Including Simulation in Local Search....Pages 402-413
Back Matter....Pages -
....