MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Approximation algorithms for the 0-extension problem." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

4 documents found, showing 1 through 4.

ATOM

Approximation algorithms for the 0-extension problem
by Gruia Calinescu, Howard Karloff, Yuval Rabani — 2001 — In Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
…APPROXIMATION ALGORITHMS FOR THE 0-EXTENSION PROBLEM GRUIA CALINESCU ∗ , HOWARD KARLOFF…
Cited by 41 (3 self) – Add To MetaCart

An improved approximation algorithm for the 0-extension problem
by Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar — 2003 — In 14th Annual ACMSIAM Symposium on Discrete Algorithms
… An improved approximation algorithm for the 0-extension problem Jittat Fakcharoenphol * Chris…
Cited by 14 (2 self) – Add To MetaCart

Approximation Algorithms for the Metric Labeling Problem via a New Linear Programming Formulation
by Chandra Chekuri, Sanjeev Khanna, Joseph (Seffi) Naor, Leonid Zosin — 2000
…, Karloff, and Rabani [7] considered approximation algorithms for the 0-extension problem. They consider a…
Cited by 40 (0 self) – Add To MetaCart

An improved decomposition theorem for graphs excluding a fixed minor
by Jittat Fakcharoenphol, Kunal Talwar — 2003 — In Proceedings of 6th Workshop on Approximation, Randomization, and Combinatorial Optimization
…. Calinescu, Karloff and Rabani [6] gave an O(r3)-approximation algorithm for the 0-extension problem…
Cited by 8 (0 self) – Add To MetaCart

Showing 1 through 4.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB