Eintrag weiter verarbeiten

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

Gespeichert in:

Personen und Körperschaften: Berg, Mark (VerfasserIn), Meyer, Ulrich (Sonstige)
Titel: Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II/ edited by Mark Berg, Ulrich Meyer
Format: E-Book
Sprache: Englisch
veröffentlicht:
Berlin, Heidelberg Springer Berlin Heidelberg 2010
Gesamtaufnahme: SpringerLink
Lecture notes in computer science ; 6347
Schlagwörter:
Buchausg. u.d.T.: Algorithms - ESA 2010 ; Part 2, Berlin : Springer, 2010, XVII, 245 S.
Quelle: Verbunddaten SWB
Zugangsinformationen: Elektronischer Volltext - Campuslizenz
Details
Zusammenfassung: 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.
Umfang: Online-Ressource (XVII, 245p. 28 illus, digital)
ISBN: 9783642157813
DOI: 10.1007/978-3-642-15781-3