Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Algorithms for capacitated vehicle routing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximating geometrical graphs via “spanners” and “banyans”
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximation algorithms for multiple-tool miling
Proceedings of the fourteenth annual symposium on Computational geometry
Resource-constrained geometric network optimization
Proceedings of the fourteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Minimizing wirelength in zero and bounded skew clock trees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Simplicity and hardness of the maximum traveling salesman problem under geometric distances
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A polynomial-time approximation scheme for weighted planar graph TSP
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On the bidirected cut relaxation for the metric Steiner tree problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for bipartite and non-bipartite matching in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Practical approximation algorithms for zero- and bounded-skew trees
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Bounded queries, approximations, and the Boolean hierarchy
Information and Computation
A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem
Journal of Global Optimization
A fast approximation algorithm for TSP with neighborhoods
Nordic Journal of Computing
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Performance Guarantees for the TSP with a Parameterized Triangle Inequality
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Stability of Approximation Algorithms for Hard Optimization Problems
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Parameterized complexity: the main ideas and connections to practical computing
Experimental algorithmics
A near-linear constant-factor approximation for euclidean bipartite matching?
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
A linear-time approximation scheme for planar weighted TSP
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Approximate distance oracles for geometric spanners
ACM Transactions on Algorithms (TALG)
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Some new directions and questions in parameterized complexity
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
GMPLS label space minimization through hypergraph layouts
Theoretical Computer Science
Approximation algorithms for the Euclidean bipartite TSP
Operations Research Letters
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
The euclidean k-supplier problem
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
We present a randomized polynomial time approximation scheme for Euclidean TSP in R/sup 2/ that is substantially more efficient than our earlier scheme (1996) (and the scheme of Mitchell (1996)). For any fixed c1 and any set of n nodes in the plane, the new scheme finds a (1+1/c)-approximation to the optimum traveling salesman tour in O(n(logn)/sup O(c)/) time. (Our earlier scheme ran in n/sup O(C)/ time.) For points in R/sup d/ the algorithm runs in O(n(logn)/sup (O(/spl radic/dc)/d-1)) time. This time is polynomial (actually nearly linear) for every fixed c, d. Designing such a polynomial-time algorithm was an open problem (our earlier algorithm (1996) ran in superpolynomial time for d/spl ges/3). The algorithm generalizes to the same set of Euclidean problems handled by the previous algorithm, including Steiner Tree, /spl kappa/-TSP, /spl kappa/-MST, etc, although for /spl kappa/-TSP and /spl kappa/-MST the running time gets multiplied by /spl kappa/. We also use our ideas to design nearly-linear time approximation schemes for Euclidean versions of problems that are known to be in P, such as Minimum Spanning Tree and Min Cost Perfect Matching. All our algorithms can be derandomized, though the running time then increases by O(n/sup d/) in R/sup d/. They also have simple parallel implementations (say, in NC/sup 2/).