Articles under category:
Combinatorial Optimization
Combinatorial Optimization
|
Volume 6, Article 11 (pages 247-290)
The Submodular Welfare Problem with Demand Queries by Uriel Feige and Jan Vondrák |
|
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 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 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 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 3 (pages 53-64)
An Improved Approximation Ratio for the Covering Steiner Problem by Anupam Gupta and Aravind Srinivasan |