Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest
problem on planar graphs and, more generally, on graphs of bounded genus. As a first step …
problem on planar graphs and, more generally, on graphs of bounded genus. As a first step …
A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
A Das, C Mathieu - Algorithmica, 2015 - Springer
In the capacitated vehicle routing problem we are given the locations of customers and
depots, along with a vehicle of capacity k k. The objective is to find a minimum length …
depots, along with a vehicle of capacity k k. The objective is to find a minimum length …
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
D Eisenstat, P Klein, C Mathieu - Proceedings of the twenty-third annual ACM …, 2012 - SIAM
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms : An
efficient polynomial-time approximation sc Page 1 An efficient polynomial-time approximation …
efficient polynomial-time approximation sc Page 1 An efficient polynomial-time approximation …
Robust algorithms for on minor-free graphs based on the Sherali-Adams hierarchy
A Magen, M Moharrami - … APPROX 2009, and 13th International Workshop …, 2009 - Springer
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 …
(PTAS) for two classical NP-hard problems on graphs when the input graph is guaranteed to …
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
A Das, C Mathieu - Proceedings of the twenty-first annual ACM-SIAM …, 2010 - SIAM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we
are given the locations of n customers and a depot, along with a vehicle of capacity k, and …
are given the locations of n customers and a depot, along with a vehicle of capacity k, and …
A PTAS for planar group steiner tree via spanner bootstrap** and prize collecting
We present the first polynomial-time approximation scheme (PTAS), ie,(1+ ε)-approximation
algorithm for any constant ε> 0, for the planar group Steiner tree problem (in which each …
algorithm for any constant ε> 0, for the planar group Steiner tree problem (in which each …
A polynomial-time approximation scheme for planar multiway cut
Given an undirected graph with edge lengths and a subset of nodes (called the terminals),
the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges, with …
the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges, with …
[LIBRO][B] Exploiting planarity for network flow and connectivity problems
G Borradaile - 2008 - search.proquest.com
By restricting the input to a problem, it often becomes possible to design more accurate or
more efficient algorithms to solve that problem. In this thesis we restrict our attention to …
more efficient algorithms to solve that problem. In this thesis we restrict our attention to …
Euclidean prize-collecting steiner forest
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner
forest and k-Steiner forest, when the vertices of the input graph are points in the Euclidean …
forest and k-Steiner forest, when the vertices of the input graph are points in the Euclidean …
A PTAS for the steiner forest problem in doubling metrics
We achieve a (randomized) polynomial-time approximation scheme (PTAS) for the Steiner
forest problem in doubling metrics. Before our work, a PTAS was given only for the …
forest problem in doubling metrics. Before our work, a PTAS was given only for the …