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

ISBN-13: 9783642157806 / Angielski / Miękka / 2010 / 245 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.- Data Structures: Time, I/Os, Entropy, Joules!.- Session 8a.- Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness.- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games.- Combinatorial Auctions with Verification Are Tractable.- How to Allocate Goods in an Online Market?.- Session 8b.- Fréchet Distance of Surfaces: Some Simple Hard Cases.- Geometric Algorithms for Private-Cache Chip Multiprocessors.- Volume in General Metric Spaces.- Shortest Cut Graph of a Surface with Prescribed Vertex Set.- Session 9a.- Induced Matchings in Subcubic Planar Graphs.- Robust Matchings and Matroid Intersections.- A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties.- Strongly Stable Assignment.- Session 9b.- Data Structures for Storing Small Sets in the Bitprobe Model.- On Space Efficient Two Dimensional Range Minimum Data Structures.- Pairing Heaps with Costless Meld.- Top-k Ranked Document Search in General Text Databases.- Best-Paper Session.- Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time.- When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings.- Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems.

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.