| Description |
1 online resource (xii, 416 pages) : illustrations (black and white) |
| Series |
Lecture notes in computer science ; 7933 |
|
LNCS sublibrary. SL 2, Programming and software engineering |
|
Lecture notes in computer science ; 7933.
|
|
LNCS sublibrary. SL 2, Programming and software engineering.
|
| Contents |
Invited Papers. Algorithms and Linear Programming Relaxations for Scheduling Unrelated Parallel Machines / Martin Skutella -- The Hub Labeling Algorithm / Andrew V. Goldberg -- Design of Practical Succinct Data Structures for Large Data Collections / Roberto Grossi, Giuseppe Ottaviano -- Transportation Networks and Graph Algorithms I. Hub Label Compression / Daniel Delling [and others] -- Faster Customization of Road Networks / Daniel Delling, Renato F. Werneck -- Intriguingly Simple and Fast Transit Routing / Julian Dibbelt [and others] -- Transit Node Routing Reconsidered / Julian Arz, Dennis Luxen, Peter Sanders -- Combinatorics and Enumeration. A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions / Lasse Kliemann [and others] -- Computational Aspects of Ordered Integer Partition with Upper Bounds / Roland Glück, Dominik Köppl, Günther Wirsching -- Hypergraph Transversal Computation with Binary Decision Diagrams / Takahisa Toda -- Efficient Counting of Maximal Independent Sets in Sparse Graphs / Fredrik Manne, Sadia Sharmin |
|
Data Structures and Compression. An Edge Quadtree for External Memory / Herman Haverkort, Mark McGranaghan, Laura Toma -- Branchless Search Programs / Amr Elmasry, Jyrki Katajainen -- Lightweight Lempel-Ziv Parsing / Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi -- Space-Efficient, High-Performance Rank and Select Structures on Uncompressed Bit Sequences / Dong Zhou, David G. Andersen, Michael Kaminsky -- Network Partitioning and Bioinformatics. Think Locally, Act Globally: Highly Balanced Graph Partitioning / Peter Sanders, Christian Schulz -- Evaluation of ILP-Based Approaches for Partitioning into Colorful Components / Sharon Bruckner [and others] -- Finding Modules in Networks with Non-modular Regions / Sharon Bruckner, Bastian Kayser, Tim O.F. Conrad -- Telling Stories Fast / Michele Borassi [and others] |
|
Mathematical Programming. Undercover Branching / Timo Berthold, Ambros M. Gleixner -- Quadratic Outer Approximation for Convex Integer Programming with Box Constraints / Christoph Buchheim, Long Trieu -- Separable Non-convex Underestimators for Binary Quadratic Programming / Christoph Buchheim, Emiliano Traversi -- Hybrid SDP Bounding Procedure / Fabio Furini, Emiliano Traversi -- Transportation Networks and Graph Algorithms II. Computing Multimodal Journeys in Practice / Daniel Delling [and others] -- Efficient Computation of Jogging Routes / Andreas Gemsa [and others] -- Dominator Certification and Independent Spanning Trees: An Experimental Study / Loukas Georgiadis [and others] -- Novel Techniques for Automorphism Group Computation / José Luis López-Presa [and others] |
|
Geometry and Optimization. Blinking Molecule Tracking / Andreas Karrenbauer, Dominik Wöll -- The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm / Davi C. Tozoni, Pedro J. de Rezende, Cid C. de Souza -- An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number / Mathias Weller -- In-Out Separation and Column Generation Stabilization by Dual Price Smoothing / Artur Pessoa [and others] -- Scheduling and Local Search. Energy Minimization via a Primal-Dual Algorithm for a Convex Program / Evripidis Bampis [and others] -- Reoptimization in Branch-and-Bound Algorithms with an Application to Elevator Control / Benjamin Hiller, Torsten Klug, Jakob Witzig -- Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows / Damianos Gavalas [and others] -- Finding Robust Solutions for the Stochastic Job Shop Scheduling Problem by Including Simulation in Local Search / Marjan van den Akker, Kevin van Blokland, Han Hoogeveen |
| 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 |
| Analysis |
computerwetenschappen |
|
computer sciences |
|
numerieke methoden |
|
numerical methods |
|
computertechnieken |
|
computer techniques |
|
wiskunde |
|
mathematics |
|
algoritmen |
|
algorithms |
|
computeranalyse |
|
computer analysis |
|
kunstmatige intelligentie |
|
artificial intelligence |
|
gegevensstructuren |
|
data structures |
|
Information and Communication Technology (General) |
|
Informatie- en communicatietechnologie (algemeen) |
| Notes |
International conference proceedings |
|
Includes author index |
|
Print version record |
| Subject |
Computer algorithms -- Congresses
|
|
Software engineering -- Congresses
|
|
Algorithms
|
|
Software
|
|
algorithms.
|
|
software.
|
|
Computer algorithms
|
|
Software engineering
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Software.
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Bonifaci, Vincenzo, editor
|
|
Demetrescu, Camil, editor
|
|
Marchetti-Spaccamela, Alberto, editor
|
| ISBN |
9783642385278 |
|
3642385273 |
|
