Library of American University of Madaba
Your cart is empty.
Berg, Mark.
Algorithms – ESA 2010 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II / [electronic resource] : edited by Mark Berg, Ulrich Meyer. - XVII, 245p. 28 illus. online resource. - Lecture Notes in Computer Science, 6347 0302-9743 ; .
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.
This book constitutes the proceedings of the 18th Annual European Symposium on Algorithms, held in Liverpool, UK in September 2010.
9783642157813
Computer science.
Computer Communication Networks.
Data structures (Computer science).
Computer software.
Electronic data processing.
Computational complexity.
Computer graphics.
Computer Science.
Algorithm Analysis and Problem Complexity.
Computer Communication Networks.
Discrete Mathematics in Computer Science.
Computer Graphics.
Numeric Computing.
Data Structures.
QA76.9.A43
005.1
Algorithms – ESA 2010 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II / [electronic resource] : edited by Mark Berg, Ulrich Meyer. - XVII, 245p. 28 illus. online resource. - Lecture Notes in Computer Science, 6347 0302-9743 ; .
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.
This book constitutes the proceedings of the 18th Annual European Symposium on Algorithms, held in Liverpool, UK in September 2010.
9783642157813
Computer science.
Computer Communication Networks.
Data structures (Computer science).
Computer software.
Electronic data processing.
Computational complexity.
Computer graphics.
Computer Science.
Algorithm Analysis and Problem Complexity.
Computer Communication Networks.
Discrete Mathematics in Computer Science.
Computer Graphics.
Numeric Computing.
Data Structures.
QA76.9.A43
005.1