Algorithms - ESA 2008 : 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008 : proceedings

• Main Authors: ESA, Halperin, Dan, Mehlhorn, Kurt
• Format: eBook Book
• Language: English
• Published: Berlin Springer 2008; Springer Berlin / Heidelberg
• Edition: 1
• Series: Lecture notes in computer science
• Subjects: Algorithms-Congresses; Computer algorithms; Computer algorithms > Congresses; Congresses
• ISBN: 9783540877431; 3540877436

This book constitutes the refereed proceedings of the 16th Annual European Symposium on Algorithms, ESA 2008, held in Karlsruhe, Germany, in September 2008 in the context of the combined conference ALGO 2008. The 67 revised full papers presented together with 2 invited lectures were carefully review...

Table of Contents:

• Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach -- Approximability of Average Completion Time Scheduling on Unrelated Machines -- Relative Convex Hulls in Semi-dynamic Subdivisions -- An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms -- On the Size of the 3D Visibility Skeleton: Experimental Results -- An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions -- Deterministic Sampling Algorithms for Network Design -- Author Index
• Title Page -- Preface -- Organization -- Table of Contents -- Flexible Path Planning Using Corridor Maps -- A Bridging Model for Multi-core Computing -- Robust Kinetic Convex Hulls in 3D -- On Dominance Reporting in 3D -- Stabbing Convex Polygons with a Segment or a Polygon -- An Efficient Algorithm for 2D Euclidean 2-Center with Outliers -- A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry -- Cache-Oblivious Red-Blue Line Segment Intersection -- The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains -- Space-Time Tradeoffs for Proximity Searching in Doubling Spaces -- A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem -- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs -- Straight Skeletons of Three-Dimensional Polyhedra -- Randomized Competitive Analysis for Two-Server Problems -- Decompositions and Boundary Coverings of Non-convex Fat Polyhedra -- Approximating Multi-criteria Max-TSP -- An Integer Programming Algorithm for Routing Optimization in IP Networks -- A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling -- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree -- Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors -- A Practical Quicksort Algorithm for Graphics Processors -- Bloomier Filters: A Second Look -- Coupled Path Planning, Region Optimization, and Applications in Intensity-Modulated Radiation Therapy -- A New Approach to Exact Crossing Minimization -- A Characterization of 2-Player Mechanisms for Scheduling -- A Local-Search 2-Approximation for 2-Correlation-Clustering -- The Alcuin Number of a Graph -- Time-Dependent SHARC-Routing -- Detecting Regular Visit Patterns -- Improved Approximation Algorithms for Relay Placement -- Selfish Bin Packing
• Improved Randomized Results for That Interval Selection Problem -- Succinct Representations of Arbitrary Graphs -- Edge Coloring and Decompositions of Weighted Graphs -- The Complexity of Sorting with Networks of Stacks and Queues -- Faster Steiner Tree Computation in Polynomial-Space -- Fitting a Step Function to a Point Set -- Faster Swap Edge Computation in Minimum Diameter Spanning Trees -- The Partial Augment-Relabel Algorithm for the Maximum Flow Problem -- An Optimal Dynamic Spanner for Doubling Metric Spaces -- RFQ: Redemptive Fair Queuing -- Range Medians -- Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves -- Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison -- On the Complexity of Optimal Hotlink Assignment -- Oblivious Randomized Direct Search for Real-Parameter Optimization -- Path Minima in Incremental Unrooted Trees -- Improved Competitive Performance Bounds for CIOQ Switches -- Two-Stage Robust Network Design with Exponential Scenarios -- An Optimal Incremental Algorithm for Minimizing Lateness with Rejection -- More Robust Hashing: Cuckoo Hashing with a Stash -- Better and Simpler Approximation Algorithms for the Stable Marriage Problem -- Edit Distances and Factorisations of Even Permutations -- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count -- Facility Location in Dynamic Geometric Data Streams -- The Effects of Local Randomness in the Adversarial Queueing Model -- Parallel Imaging Problem -- An Online Algorithm for Finding the Longest Previous Factors -- Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions -- Improved BDD Algorithms for the Simulation of Quantum Circuits -- Mobile Route Planning -- How Reliable Are Practical Point-in-Polygon Strategies?
• Cache-Oblivious Red-Blue Line Segment Intersection -- Introduction -- Vertically Sorting Non-intersecting Segments -- Red-Blue Line Segment Intersection -- Short-Long Intersections -- Long-Long Intersections -- References -- The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains -- Introduction -- Preliminaries -- TheBisector -- The Voronoi Diagram -- Conclusion -- References -- Space-Time Tradeoffs for Proximity Searching in Doubling Spaces -- Introduction -- Overview of Techniques -- Preliminaries -- The Well-Separated Pair Decomposition -- The Region-DAG -- Construction -- Approximate Voronoi Diagrams -- References -- A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem -- Introduction -- Preliminaries -- Algorithm Outline -- Scaling Step -- Augmentation Step -- Extension Step -- Running Time -- References -- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs -- Introduction -- Preliminaries -- Cyclic Level Non-planarity Patterns -- Cyclic Level Planarity Testing and Embedding -- Summary and Open Problems -- References -- Straight Skeletons of Three-Dimensional Polyhedra -- Introduction -- Related Prior Work -- Our Results -- Voxel Polyhedra -- A Volume Proportional-Time Algorithm -- Output-Sensitive Voxel Sweep -- Orthogonal Polyhedra -- Definition -- Complexity Bounds -- Algorithms -- General Polyhedra -- Ambiguity -- A Combinatorial Lower Bound -- The Algorithm -- References -- Randomized Competitive Analysis for Two-Server Problems -- Introduction -- Our Approach -- Three Points on a Line -- Construction of the Finite Set of Triangles -- Concluding Remarks -- References -- Decompositions and Boundary Coverings of Non-convex Fat Polyhedra -- Introduction -- Decomposing the Interior -- Decompositions into Arbitrary Tetrahedra -- Decompositions and Coverings with Fat Tetrahedra
• Coupled Path Planning, Region Optimization, and Applications in Intensity-Modulated Radiation Therapy -- Introduction -- Unconstrained Coupled Path Planning (UCPP) -- The UCPP Problem Definition and Graph Modeling -- Speeding Up the Shortest Path Computation Using Geometry -- Extension -- Constrained Coupled Path Planning (CCPP) -- Computing the Set of All CCPP Problem Instances -- IMRT Applications -- References -- A New Approach to Exact Crossing Minimization -- Introduction -- TheOocm ILP Formulation -- Variables and Linear Ordering -- Kuratowski Constraints and Correctness of Oocm -- Branch-and-Cut-and-Price Algorithm -- Upper Bounds and Integer Interpretation -- Initial Constraints and Separation -- Combinatorial Column Generation -- Branching on K_5-Constraints -- FurtherRemarks -- Experiments -- References -- A Characterization of 2-Player Mechanisms for Scheduling -- Introduction -- Related Work -- The Characterization of Decisive Mechanisms for 2 Tasks -- The Case of Many Tasks -- Lower Bound for 2 Tasks -- References -- A Local-Search 2-Approximation for 2-Correlation-Clustering -- Introduction -- The 2CC Problem -- Related Work -- History of the 2CC Problem -- Layout of the Paper -- Algorithms to Solve 2CC -- Pick-a-Vertex Type Algorithms -- Local Search -- The PASTA-toss Algorithm -- A Spectral Algorithm -- The PTAS -- PASTA-toss Is a 2-Approximation -- Switching -- Switching-Invariant Algorithms -- Proof That PASTA-toss Is a 2-Approximation -- The PASTA-flip Algorithm -- Removing Bad Cycles -- The PASTA-flip Algorithm -- Experimental Work -- Algorithms Tested -- Datasets -- Results -- Conclusions -- Further Work -- References -- The Alcuin Number of a Graph -- Introduction -- Definitions and Preliminaries -- A Concise Characterization -- Small Boats Versus Big Boats -- An Algorithmic Result -- Hardness Results -- Special Graph Classes
• Chordal Graphs and Trees -- Bipartite Graphs -- Planar Graphs -- Conclusions -- References -- Time-Dependent SHARC-Routing -- Introduction -- Preliminaries -- Models and Basic Algorithms -- Exact Time-Dependent SHARC -- Time-Dependent Preprocessing -- Query -- Experiments -- Time-Dependent Timetable Information -- Time-Dependent Road Networks -- Conclusion -- References -- Detecting Regular Visit Patterns -- Introduction -- Optimally Solving LDS -- Given Offsets and Period Lengths -- Given Period Lengths (Approximate) -- Given Period Lengths (Exact) -- Nothing Given -- Concluding Remarks -- References -- Improved Approximation Algorithms for Relay Placement -- Introduction -- Blobs, Clouds, Stabs, Hubs, and Forests -- Steiner Forests and Spanning Forests with Neighbourhoods -- A 3.11-Approximation Algorithm -- Overview -- Clouds with Few Stabs -- Stitching a Cloud from \myC^{k+} -- Green Relays and Cloud Clusters -- Interconnecting the Clusters -- Analysis: Red and Green Relays -- Analysis: Yellow Relays -- Inapproximability of One-Tier Relay Placement -- References -- Selfish Bin Packing -- Introduction -- The Bin Packing Game -- Related Work and Our Contributions -- The Price of Stability -- The Price of Anarchy -- A Lower Bound: Construction -- An Upper Bound -- Bounding the SPoA and the SPoS -- Summary and Conclusions -- References -- Improved Randomized Results for That Interval Selection Problem -- Introduction -- The Algorithm -- Barely Random Algorithms -- The Lower Bound -- Concluding Remarks -- References -- Succinct Representations of Arbitrary Graphs -- Introduction -- Related Work -- Preliminaries -- Space Lower Bounds -- Lower Bound for the Moderate Case -- Lower Bound for the Sparse Case -- Upper Bound: The Representation -- The over Half Full Case -- The Dense Case -- The Moderate Case -- The Sparse Case
• Intro -- Title Page -- Preface -- Organization -- Table of Contents -- Flexible Path Planning Using Corridor Maps -- Introduction -- The Corridor Map -- The Original Corridor Map Method -- The Improved Approach -- Computing an Explicit Corridor Boundary Representation -- The Boundary Force -- The Steering Force -- Experiments -- Results -- Using Alternative Control Paths -- Conclusions -- References -- A Bridging Model for Multi-core Computing -- Introduction -- The Multi-BSP Model -- Work-Limited Algorithms -- General Lower Bounds -- Optimal Algorithms -- Associative Composition -- Matrix Multiplication -- Fast Fourier Transform -- Sorting -- References -- Robust Kinetic Convex Hulls in 3D -- Introduction -- Robust Motion Simulation on a Lattice -- Algorithm -- Implementation -- Experiments -- Conclusion -- References -- On Dominance Reporting in 3D -- Introduction -- Preliminaries -- Optimal Approximate Levels -- Solving the Dominance Reporting Problem -- The External Memory Model -- References -- Stabbing Convex Polygons with a Segment or a Polygon -- Introduction -- Complexity of \F for a Segment -- Complexity of \F for a Convex k-gon -- Computing Critical Placements -- Computing a Hitting Set -- References -- An Efficient Algorithm for 2D Euclidean 2-Center with Outliers -- Introduction -- Arrangement of Unit Disks -- Well-Separated Disks -- Nearly Concentric Disks -- References -- A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry -- Introduction -- Preliminaries and Notation -- Outline of the Proof of Theorem 1 and Intuition -- Proof of Theorem 2 -- Assignment of Terminals to Their Mates -- Properties of Runs and Labellings -- Bounding the Cost C_{1,i} -- Bounding C_{2,i} and C_{3,i} -- Towards Bounding Cost C_{4,i} -- Adding Up the Individual Contributions -- References
• Covering the Boundary -- Concluding Remarks -- References -- Approximating Multi-criteria Max-TSP -- Multi-criteria Traveling Salesman Problem -- Traveling Salesman Problem -- Multi-criteria Optimization -- New Results -- Outline and Idea -- Decompositions -- Existence of Decompositions -- Finding Decompositions -- Approximation Algorithms -- Multi-criteria Max-ATSP -- Multi-criteria Max-STSP -- Remarks -- References -- An Integer Programming Algorithm for Routing Optimization in IP Networks -- Introduction -- Notation and Preliminaries -- Integer Programming Algorithm -- Master Problem -- Client Problem -- Implementation -- Results -- References -- A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling -- Introduction -- The Model -- A Feasibility Test -- An FPTAS for Load Estimation -- References -- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree -- Introduction -- Preliminaries -- A Faster FPT Algorithm for k-LOT -- A Fast FPT Algorithm for k-LOB -- Lower Bounds for the Number of Leaves -- Discussion -- References -- Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors -- Introduction -- Labeling Schemes for Least Common Ancestors -- Experimental Framework -- Experimental Results -- References -- A Practical Quicksort Algorithm for Graphics Processors -- Introduction -- The System Model -- The Algorithm -- Overview -- Detailed Description -- Experimental Evaluation -- Discussion -- Conclusions -- References -- Bloomier Filters: A Second Look -- Introduction -- The Construction -- A 1-Bit Bloomier Filter -- General k-Bit Bloomier Filters -- Mutable Bloomier Filters -- Reducing the Space Utilization -- Full Rank Sparse Matrices over a Finite Field -- The Algorithm -- Bucketing -- References
• Conclusion and Final Remarks