Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
When Hamming meets Euclid: the approximability of geometric TSP and MST (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On exact solutions for the rectilinear Steiner tree problem
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
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
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
Asymmetric rendezvous on the plane
Proceedings of the fourteenth annual symposium on Computational geometry
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
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 1.598 approximation algorithm for the Steiner problem in graphs
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
A polylogarithmic approximation algorithm for the group Steiner tree problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Network design and improvement
ACM Computing Surveys (CSUR)
An approximation algorithm for the covering Steiner problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh 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
Algorithms for facility location problems with outliers
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Bounded queries, approximations, and the Boolean hierarchy
Information and Computation
Information and Computation
A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem
Journal of Global Optimization
Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree
Journal of Heuristics
Approximations for Steiner Trees with Minimum Number of Steiner Points
Journal of Global Optimization
On the Euclidean 3-matching problem
Nordic Journal of Computing
On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications
ICDT '99 Proceedings of the 7th International Conference on Database Theory
On the Approximability of the Steiner Tree Problem
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Filtering with Approximate Predicates
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Performance Guarantees for the TSP with a Parameterized Triangle Inequality
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Approximation Results for Kinetic Variants of TSP
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Parameterized Complexity: The Main Ideas and Some Research Frontiers
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
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
On the Competitive Complexity of Navigation Tasks
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
Mining Semi-structured Data by Path Expressions
DS '01 Proceedings of the 4th International Conference on Discovery Science
A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
On the approximability of the Steiner tree problem
Theoretical Computer Science - Mathematical foundations of computer science
Parameterized complexity: the main ideas and connections to practical computing
Experimental algorithmics
Local search algorithms for the k-cardinality tree problem
Discrete Applied Mathematics
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A linear-time approximation scheme for planar weighted TSP
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
8/7-approximation algorithm for (1,2)-TSP
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The polygonal contraction heuristic for rectilinear Steiner tree construction
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
A quasi-polynomial time approximation scheme for minimum weight triangulation
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Lossy network correlated data gathering with high-resolution coding
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
The approximability of the weighted Hamiltonian path completion problem on a tree
Theoretical Computer Science
Constructing pairwise disjoint paths with few links
ACM Transactions on Algorithms (TALG)
On clustering to minimize the sum of radii
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A better differential approximation ratio for symmetric TSP
Theoretical Computer Science
Path planning on a cuboid using genetic algorithms
Information Sciences: an International Journal
A 3-approximation algorithm for the subtree distance between phylogenies
Journal of Discrete Algorithms
Minimum Spanning Tree with Neighborhoods
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
A quasi-polynomial time approximation scheme for minimum weight triangulation
Journal of the ACM (JACM)
The Euclidean degree-4 minimum spanning tree problem is NP-hard
Proceedings of the twenty-fifth annual symposium on Computational geometry
Facet detection and visualizing local structure in graphs
GVE '07 Proceedings of the IASTED International Conference on Graphics and Visualization in Engineering
Approximation schemes for degree-restricted MST and red-blue separation problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A fast approximation algorithm for TSP with neighborhoods and red-blue separation
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth
Proceedings of the forty-second ACM symposium on Theory of computing
Process visualization to solve the travelling salesman problem
Proceedings of the 3rd International Symposium on Visual Information Communication
Stochastic minimum spanning trees in euclidean spaces
Proceedings of the twenty-seventh annual symposium on Computational geometry
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
Journal of the ACM (JACM)
Staying-alive path planning with energy optimization for mobile robots
Expert Systems with Applications: An International Journal
Linear time algorithms for clustering problems in any dimensions
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Efficient approximation schemes for geometric problems?
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Exploring simple grid polygons
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On trip planning queries in spatial databases
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Some new directions and questions in parameterized complexity
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
The planar k-means problem is NP-hard
Theoretical Computer Science
Oblivious low-congestion multicast routing in wireless networks
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Improved bounds for vehicle routing solutions
Discrete Optimization
Approximation algorithms for the Euclidean bipartite TSP
Operations Research Letters
On Clustering to Minimize the Sum of Radii
SIAM Journal on Computing
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
New approximation algorithms for the unsplittable capacitated facility location problem
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Minimum weight 2-edge-connected spanning subgraphs in planar graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Comparing Problem Solving Strategies for NP-hard Optimization Problems
Fundamenta Informaticae - Cognitive Informatics and Computational Intelligence: Theory and Applications
| Hi-index | 0.01 |
We present a polynomial time approximation scheme for Euclidean TSP in /spl Rfr//sup 2/. Given any n nodes in the plane and /spl epsiv/0, the scheme finds a (1+/spl epsiv/)-approximation to the optimum traveling salesman tour in time n/sup 0(1//spl epsiv/)/. When the nodes are in /spl Rfr//sup d/, the running time increases to n(O/spl tilde/(log/sup d-2/n)//spl epsiv//sup d-1/) The previous best approximation algorithm for the problem (due to Christofides (1976)) achieves a 3/2-approximation in polynomial time. We also give similar approximation schemes for a host of other Euclidean problems, including Steiner Tree, k-TSP, Minimum degree-k, spanning tree, k-MST, etc. (This list may get longer; our techniques are fairly general.) The previous best approximation algorithms for all these problems achieved a constant-factor approximation. All our algorithms also work, with almost no modification, when distance is measured using any geometric norm (such as l/sub p/ for p/spl ges/1 or other Minkowski norms).