logo
http://theoryofcomputing.org     ISSN 1557-2862
Endorsed by ACM SIGACT
  • Home
  • Introduction
  • Articles
  • Library
  • Editors
  • Submit
  • Issues
  • Contact Us
  • Search
Articles under category:
Graphs
Volume 7, Article 3 (pages 27-43)
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
by Per Austrin, Subhash Khot, and Muli Safra
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 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 5 (pages 91-120)
Iterative Construction of Cayley Expander Graphs
by Eyal Rozenman, Aner Shalev, and Avi Wigderson