Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Algorithms -- ESA 2011: 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011, Proceedings > Improved Approximations for k-Exchange Systems
Algorithms -- ESA 2011: 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011, Proceedings |
Camil Demetrescu; Magnús M. Halldórsson
Springer Berlin Heidelberg
Algorithms -- ESA 2011: 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011, Proceedings
Improved Approximations for k-Exchange Systems
Authors

Moran Feldman; Joseph (Seffi) Naor; Roy Schwartz; Justin Ward

ARI Id

1674219721881_2943354

Access

Open/Free Access

Pages

784-798

DOI

10.1007/978-3-642-23719-5_66

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-23719-5_66

Table of Contents of Book
Showing 1 to 20 of 69 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget Constraints
Akiyoshi Shioura
1-12
Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph
Loukas Georgiadis
13-24
Improved Approximation Algorithms for Bipartite Correlation Clustering
Nir Ailon; Noa Avigdor-Elgrabli; Edo Liberty; Anke van Zuylen
25-36
Bounds on Greedy Algorithms for MAX SAT
Matthias Poloczek
37-48
Approximating Minimum Manhattan Networks in Higher Dimensions
Aparna Das; Emden R. Gansner; Michael Kaufmann; Stephen Kobourov; Joachim Spoerhase; Alexander Wolff
49-60
On Isolating Points Using Disks
Matt Gibson; Gaurav Kanade; Kasturi Varadarajan
61-69
An Output-Sensitive Approach for the L 1/L  ∞  k-Nearest-Neighbor Voronoi Diagram
Chih-Hung Liu; Evanthia Papadopoulou; D. T. Lee
70-81
Can Nearest Neighbor Searching Be Simple and Always Fast?
Victor Alvarez; David G. Kirkpatrick; Raimund Seidel
82-92
On the Approximation Performance of Fictitious Play in Finite Games
Paul W. Goldberg; Rahul Savani; Troels Bjerre Sørensen; Carmine Ventre
93-105
How Profitable Are Strategic Behaviors in a Market?
Ning Chen; Xiaotie Deng; Jie Zhang
106-118
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
George Christodoulou; Kurt Mehlhorn; Evangelia Pyrga
119-130
Algorithms for Finding a Maximum Non-k-linked Graph
Yusuke Kobayashi; Yuichi Yoshida
131-142
An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
Andreas Emil Feldmann; Peter Widmayer
143-154
Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time
Jakub Łącki; Piotr Sankowski
155-166
Near-Popular Matchings in the Roommates Problem
Chien-Chung Huang; Telikepalli Kavitha
167-179
The Hospitals/Residents Problem with Quota Lower Bounds
Koki Hamada; Kazuo Iwama; Shuichi Miyazaki
180-191
Multi-parameter Mechanism Design under Budget and Matroid Constraints
Monika Henzinger; Angelina Vidali
192-202
Quantified Linear Programs: A Computational Study
Thorsten Ederer; Ulf Lorenz; Alexander Martin; Jan Wolf
203-214
Recoverable Robustness by Column Generation
P. C. Bouman; J. M. van den Akker; J. A. Hoogeveen
215-226
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 69 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings