Cover Image
Read Now

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

Full description

Bibliographic Details
Other Authors: Bonifaci, Vincenzo (Editor), Demetrescu, Camil (Editor), Marchetti-Spaccamela, Alberto (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2013, 2013
Edition:1st ed. 2013
Series:Theoretical Computer Science and General Issues
Subjects:
Artificial Intelligence / Data Processing
Computer Science / Mathematics
Numerical Analysis
Discrete Mathematics In Computer Science
Artificial Intelligence
Algorithms
Discrete Mathematics
Data Science
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 04327nmm a2200421 u 4500
001 EB000391426
003 EBX01000000000000000244479
005 00000000000000.0
007 cr|||||||||||||||||||||
008 130626 ||| eng
020 |a 9783642385278 
100 1 |a Bonifaci, Vincenzo  |e [editor] 
245 0 0 |a Experimental Algorithms  |h Elektronische Ressource  |b 12th International Symposium, SEA 2013, Rome, Italy, June 5-7, 2013, Proceedings  |c edited by Vincenzo Bonifaci, Camil Demetrescu, Alberto Marchetti-Spaccamela 
250 |a 1st ed. 2013 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2013, 2013 
300 |a XII, 416 p. 81 illus  |b online resource 
505 0 |a 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 --  
505 0 |a 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 --  
505 0 |a 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 
653 |a Artificial intelligence / Data processing 
653 |a Computer science / Mathematics 
653 |a Numerical Analysis 
653 |a Discrete Mathematics in Computer Science 
653 |a Artificial Intelligence 
653 |a Algorithms 
653 |a Artificial intelligence 
653 |a Numerical analysis 
653 |a Discrete mathematics 
653 |a Data Science 
700 1 |a Demetrescu, Camil  |e [editor] 
700 1 |a Marchetti-Spaccamela, Alberto  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Theoretical Computer Science and General Issues 
028 5 0 |a 10.1007/978-3-642-38527-8 
856 4 0 |u https://doi.org/10.1007/978-3-642-38527-8?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 518.1 
520 |a 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 

Similar Items