Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
A better approximation algorithm for finding planar subgraphs
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Some optimal inapproximability results
Journal of the ACM (JACM)
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Excluding any graph as a minor allows a low tree-width 2-coloring
Journal of Combinatorial Theory Series B
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Linear programming relaxations of maxcut
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A polynomial-time approximation scheme for Steiner tree in planar graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On allocations that maximize fairness
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fast approximation algorithms for knapsack problems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Approximate formulations for 0-1 knapsack sets
Operations Research Letters
Tree-width and the Sherali-Adams operator
Discrete Optimization
On linear and semidefinite programming relaxations for hypergraph matching
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximating sparsest cut in graphs of bounded treewidth
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Sparsest cut on bounded treewidth graphs: algorithms and hardness results
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
This work provides a Linear Programming-based Polynomial Time Approximation Scheme (PTAS) for two classical NP-hard problems on graphs when the input graph is guaranteed to be planar, or more generally Minor Free. The algorithm applies a sufficiently large number (some function of when approximation is required) of rounds of the so-called Sherali-Adams Lift-and-Project system. needed to obtain a -approximation, where f is some function that depends only on the graph that should be avoided as a minor. The problem we discuss are the well-studied problems, the and problems. An curious fact we expose is that in the world of minor-free graph, the is harder in some sense than the . Our main result shows how to get a PTAS for in the more general "noisy setting" in which input graphs are not assumed to be planar/minor-free, but only close to being so. In this setting we bound integrality gaps by , which in turn provides a approximation of the optimum value; however we don't know how to actually find a solution with this approximation guarantee. While there are known combinatorial algorithms for the non-noisy setting of the above graph problems, we know of no previous approximation algorithms in the noisy setting. Further, we give evidence that current combinatorial techniques will fail to generalize to this noisy setting.