Algorithms - ESA 2010 - neues Buch

EAN (ISBN-13): 9783642157752
Erscheinungsjahr: 2010
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2017-04-03T01:05:13+02:00 (Vienna)
Detailseite zuletzt geändert am 2021-03-25T11:04:26+01:00 (Vienna)
ISBN/EAN: 9783642157752

ISBN - alternative Schreibweisen:
978-3-642-15775-2
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: berg, meyer ulrich
Titel des Buches: esa, liverpool

---

Daten vom Verlag:

Autor/in: Mark de Berg; Ulrich Meyer
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Algorithms - ESA 2010 - 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings
Verlag: Springer; Springer Berlin
587 Seiten
Erscheinungsjahr: 2010-09-02
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XVIII, 587 p. 68 illus.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Software Engineering; Verstehen; CSP; Huffman; Partition; Permutation; Routing; Scheduling; algorithmic aspects; algorithms; complexity; data structures; graph algorithms; planar graphs; real-time scheduling; sorting; algorithm analysis and problem complexity; C; Software Engineering; Algorithms; Computer Communication Networks; Discrete Mathematics in Computer Science; Computer Graphics; Numerical Analysis; Computer Science; Algorithmen und Datenstrukturen; Netzwerk-Hardware; Mathematik für Informatiker; Diskrete Mathematik; Grafikprogrammierung; Numerische Mathematik; BC

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 forGraphical 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.
up-to-date results fast track conference proceedings state-of-the-art report