Algorithms : ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Part I (eBook, 2010) [WorldCat.org]
skip to content
Algorithms : ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Part I Preview this item
ClosePreview this item
Checking...

Algorithms : ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Part I

Author: Mark de Berg; Ulrich Meyer, Dipl.-Ing.
Publisher: Berlin ; Heidelberg ; New York, NY : Springer, ©2010.
Series: Lecture notes in computer science, 6346.; Lecture notes in computer science., Advanced research in computing and software science.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
Edition/Format:   eBook : Document : Conference publication : English
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Conference papers and proceedings
Congresses
Additional Physical Format: Print version:
Algorithms Pt. 1.
Berlin ; Heidelberg ; New York, NY : Springer, ©2010
Material Type: Conference publication, Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Mark de Berg; Ulrich Meyer, Dipl.-Ing.
ISBN: 9783642157752 3642157750
OCLC Number: 676699608
Description: 1 online resource (xviii, 587 pages) : illustrations
Contents: 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.
Series Title: Lecture notes in computer science, 6346.; Lecture notes in computer science., Advanced research in computing and software science.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
Responsibility: Mark de Berg, Ulrich Meyer (ed.).

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.