Algorithms - ESA 2010: 18th Annual European Symposium, Liverpool, Uk, September 6-8, 2010, Proceedings

ISBN-13: 9783642157745 / Angielski / Miękka / 2010 / 587 str.

Mark de Berg; Ulrich Meyer

Opis

This volume contains the 69 papers presented at the 16th Annual European Symposium on Algorithms (ESA 2010), held in Liverpool during September 6 8, 2010, including three papers by the distinguished invited speakers Artur Czumaj, Herbert Edelsbrunner, and Paolo Ferragina. ESA 2010 was organized as a part of ALGO 2010, which also included the 10th Workshop on Algorithms in Bioinformatics (WABI), the 8th Workshop on Approximation and Online Algorithms (WAOA), and the 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS). The European Symposium on Algorithms covers research in the design, use, andanalysisofe?cientalgorithmsanddata structures.As inpreviousyears, the symposium had two tracks: the Design and Analysis Track and the Engineering and Applications Track, each with its own Program Committee. In total 245 papers adhering to the submission guidelines were submitted. Each paper was reviewed by three or four referees. Based on the reviews and the often extensive electronicdiscussionsfollowingthem, thecommittees selected 66papersintotal: 56 (out of 206) to the Design and Analysis Track and 10 (out of 39) to the Engineering andApplicationstrack.We believethat thesepaperstogethermade up a strong and varied program, showing the depth and breadth of current algorithms research."

Spis treści

Invited Talk.- The Robustness of Level Sets.- Session 1a.- Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods.- Non-clairvoyant Speed Scaling for Weighted Flow Time.- A Robust PTAS for Machine Covering and Packing.- Session 1b.- Balancing Degree, Diameter and Weight in Euclidean Spanners.- Testing Euclidean Spanners.- Fast Approximation in Subspaces by Doubling Metric Decomposition.- f-Sensitivity Distance Oracles and Routing Schemes.- Session 2a.- Fast Minor Testing in Planar Graphs.- On the Number of Spanning Trees a Planar Graph Can Have.- Contractions of Planar Graphs in Polynomial Time.- Session 2b.- Communication Complexity of Quasirandom Rumor Spreading.- A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing.- Contribution Games in Social Networks.- Session 3a.- Improved Bounds for Online Stochastic Matching.- Online Stochastic Packing Applied to Display Ad Allocation.- Caching Is Hard – Even in the Fault Model.- Session 3b.- Superselectors: Efficient Constructions and Applications.- Estimating the Average of a Lipschitz-Continuous Function from One Sample.- Streaming Graph Computations with a Helpful Advisor.- Session 4a.- Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier.- Minimum Vertex Cover in Rectangle Graphs.- Feedback Vertex Sets in Tournaments.- Session 4b.- n-Level Graph Partitioning.- Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns.- Finding the Diameter in Real-World Graphs.- Session 5a.- Budgeted Red-Blue Median and Its Generalizations.- All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables.- Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems.- Robust Algorithms for Sorting Railway Cars.- Session 5b.- Cloning Voronoi Diagrams via Retroactive Data Structures.- A Unified Approach to Approximate Proximity Searching.- Spatio-temporal Range Searching over Compressed Kinetic Sensor Data.- Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space.- Invited Talk.- Local Graph Exploration and Fast Property Testing.- Session 6a.- A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings.- Fast Prefix Search in Little Space, with Applications.- On the Huffman and Alphabetic Tree Problem with General Cost Functions.- Medium-Space Algorithms for Inverse BWT.- Session 6b.- Median Trajectories.- Optimal Cover of Points by Disks in a Simple Polygon.- Stability of ?-Kernels.- The Geodesic Diameter of Polygonal Domains.- Session 7a.- Polyhedral and Algorithmic Properties of Quantified Linear Programs.- Approximating Parameterized Convex Optimization Problems.- Approximation Schemes for Multi-Budgeted Independence Systems.- Session 7b.- Algorithmic Meta-theorems for Restrictions of Treewidth.- Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus.- Constructing the R* Consensus Tree of Two Trees in Subcubic Time.

O autorze

Prof. Dr. Ulrich Meyer ist Professor Emeritus für Volkswirtschaftslehre, insbes. Mikroökonomie und Ordnungspolitik an der Universität Bamberg. Er studierte Mathematik und Volkswirtschaftslehre und promovierte und habilitierte an der Universität Münster. Vor der Übernahme des Lehrstuhles in Bamberg hatte er Lehrstuhlvertretungen an den Universitäten Osnabrück und Bamberg und eine Professor für Volkswirtschaftslehre an der Universität Mainz inne.