Algorithms -- ESA 2010, Part II 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings /
Algorithms -- ESA 2010, Part II 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings / [electronic resource] :
edited by Mark de Berg, Ulrich Meyer.
- 1st ed. 2010.
- XVII, 245 p. 28 illus. online resource.
- Theoretical Computer Science and General Issues, 6347 2512-2029 ; .
- Theoretical Computer Science and General Issues, 6347 .
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.
9783642157813
10.1007/978-3-642-15781-3 doi
Computer programming.
Algorithms.
Computer networks .
Computer science--Mathematics.
Discrete mathematics.
Computer graphics.
Numerical analysis.
Programming Techniques.
Algorithms.
Computer Communication Networks.
Discrete Mathematics in Computer Science.
Computer Graphics.
Numerical Analysis.
QA76.6-76.66
005.11
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.
9783642157813
10.1007/978-3-642-15781-3 doi
Computer programming.
Algorithms.
Computer networks .
Computer science--Mathematics.
Discrete mathematics.
Computer graphics.
Numerical analysis.
Programming Techniques.
Algorithms.
Computer Communication Networks.
Discrete Mathematics in Computer Science.
Computer Graphics.
Numerical Analysis.
QA76.6-76.66
005.11