Experimental Algorithms : 12th International Symposium, SEA 2013, Rome, Italy, June 5-7, 2013, Proceedings / edited by Vincenzo Bonifaci, Camil Demetrescu, Alberto Marchetti-Spaccamela.

Format:

Book

Contributor:

Bonifaci, Vincenzo, editor.

Demetrescu, Camil, editor.

Marchetti-Spaccamela, Alberto, editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 7933.

Theoretical Computer Science and General Issues ; 7933

Language:

English

Subjects (All):

Algorithms.

Data structures (Computer science).

Computer science--Mathematics.

Computer science.

Numerical analysis.

Artificial intelligence.

Algorithm Analysis and Problem Complexity.

Data Structures.

Discrete Mathematics in Computer Science.

Numeric Computing.

Artificial Intelligence.

Local Subjects:

Algorithm Analysis and Problem Complexity.

Data Structures.

Discrete Mathematics in Computer Science.

Numeric Computing.

Artificial Intelligence.

Algorithms.

Physical Description:

1 online resource (XII, 416 pages) : 81 illustrations.

Edition:

First edition 2013.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.

System Details:

text file PDF

Summary:

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.

Contents:

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

Other Format:

Printed edition:

ISBN:

978-3-642-38527-8

9783642385278

Access Restriction:

Restricted for use by site license.