Articles under category:
Algorithms
Algorithms
|
Volume 7, Article 5 (pages 49-74)
Metric Clustering via Consistent Labeling by Robert Krauthgamer and Tim Roughgarden |
|
Volume 7, Article 2 (pages 19-25)
[NOTE]
Inverting a Permutation is as Hard as Unordered Search by Ashwin Nayak |
|
Volume 6, Article 11 (pages 247-290)
The Submodular Welfare Problem with Demand Queries by Uriel Feige and Jan Vondrák |
|
Volume 6, Article 8 (pages 179-199)
Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing Games by Avrim Blum, Eyal Even-Dar, and Katrina Ligett |
|
Volume 6, Article 2 (pages 27-46)
Reordering Buffers for General Metric Spaces by Matthias Englert, Harald Räcke, and Matthias Westermann |
|
Volume 5, Article 9 (pages 173-189)
All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time by Virginia Vassilevska, Ryan Williams, and Raphael Yuster |
|
Volume 5, Article 4 (pages 83-117)
SDP Gaps and UGC-hardness for Max-Cut-Gain by Subhash Khot and Ryan O'Donnell |
|
Volume 4, Article 9 (pages 191-193)
[COMMENT]
On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem by Viswanath Nagarajan |
|
Volume 4, Article 5 (pages 111-128)
Approximation Algorithms for Unique Games by Luca Trevisan |
|
Volume 4, Article 2 (pages 21-51)
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector problem by Miklós Ajtai |
|
Volume 4, Article 1 (pages 1-20)
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks by Henning Bruhn, Jakub Černý, Alexander Hall, Petr Kolman, and Jiří Sgall |
|
Volume 3, Article 11 (pages 211-219)
The Randomized Communication Complexity of Set Disjointness by Johan Håstad and Avi Wigderson |
|
Volume 3, Article 10 (pages 197-209)
An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem by Chandra Chekuri and Martin Pál |
■
|
|
Volume 3, Article 9 (pages 179-195)
Approximation Algorithms and Online Mechanisms for Item Pricing by Maria-Florina Balcan and Avrim Blum |
|
Volume 3, Article 8 (pages 159-177)
Removing Degeneracy May Require a Large Dimension Increase by Jiří Matoušek and Petr Škovroň |
|
Volume 3, Article 1 (pages 1-23)
Censorship Resistant Peer-to-Peer Networks by Amos Fiat and Jared Saia |
|
Volume 2, Article 13 (pages 249-266)
Correlation Clustering with a Fixed Number of Clusters by Ioannis Giotis and Venkatesan Guruswami |
|
Volume 2, Article 12 (pages 225-247)
Matrix Approximation and Projective Clustering via Volume Sampling by Amit Deshpande, Luis Rademacher, Santosh Vempala, and Grant Wang |
|
Volume 2, Article 11 (pages 207-224)
Embedding the Ulam metric into ℓ1 by Moses Charikar and Robert Krauthgamer |
|
Volume 2, Article 10 (pages 185-206)
Learning Restricted Models of Arithmetic Circuits by Adam Klivans and Amir Shpilka |
|
Volume 2, Article 8 (pages 147-172)
On Learning Random DNF Formulas Under the Uniform Distribution by Jeffrey C. Jackson and Rocco A. Servedio |
|
Volume 2, Article 7 (pages 137-146)
An O(√n) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow by Chandra Chekuri, Sanjeev Khanna, and F. Bruce Shepherd |
|
Volume 2, Article 4 (pages 65-90)
Rank Bounds and Integrality Gaps for Cutting Planes Procedures by Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, and Toniann Pitassi |
|
Volume 2, Article 3 (pages 53-64)
An Improved Approximation Ratio for the Covering Steiner Problem by Anupam Gupta and Aravind Srinivasan |
|
Volume 1, Article 6 (pages 105-117)
Combining Online Algorithms for Acceptance and Rejection by Yossi Azar, Avrim Blum, David P. Bunde, and Yishay Mansour |