The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Rearranging data to maximize the efficiency of compression
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
ACM SIGACT News
Fast geometric approximation techniques and geometric embedding problems
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
On minimal rectilinear Steiner trees in all dimensions
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Area optimization of simple polygons
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
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
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Synthesis of bent sheet metal parts from design features
Proceedings of the fifth ACM symposium on Solid modeling and applications
On the Euclidean 3-matching problem
Nordic Journal of Computing
A fast approximation algorithm for TSP with neighborhoods
Nordic Journal of Computing
Balanced Partition of Minimum Spanning Trees
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Approximation Results for Kinetic Variants of TSP
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Tree-Approximations for the Weighted Cost-Distance Problem
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
TSP with Neighborhoods of Varying Size
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Constructing exact octagonal steiner minimal trees
Proceedings of the 13th ACM Great Lakes symposium on VLSI
Completeness classes in algebra
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The complexity of design automation problems
DAC '80 Proceedings of the 17th Design Automation Conference
An optimal solution to a wire-routing problem (preliminary version)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Heuristics for weighted perfect matching
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
The geometric maximum traveling salesman problem
Journal of the ACM (JACM)
Guest Column: NP-complete problems and physical reality
ACM SIGACT News
TSP with neighborhoods of varying size
Journal of Algorithms
On the complexity of approximating tsp with neighborhoods and related problems
Computational Complexity
Good triangulations yield good tours
Computers and Operations Research
A gestalt genetic algorithm: less details for better search
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Parallelisation of a distributed hydrologic model
International Journal of Computer Applications in Technology
Algorithms and analysis of scheduling for loops with minimum switching
International Journal of Computational Science and Engineering
Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem
SAB '08 Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats
Automata, Probability, and Recursion
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Journal of the ACM (JACM)
MAkE: Multiobjective algorithm for k-way equipartitioning of a point set
Applied Soft Computing
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Polyhedra of minimal area as 3D object models
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
On Euclidean vehicle routing with allocation
Computational Geometry: Theory and Applications
TSP with neighborhoods of varying size
Journal of Algorithms
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
A memetic-clustering-based evolution strategy for traveling salesman problems
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Theoretical Computer Science
On models and query languages for probabilistic processes
ACM SIGMOD Record
The computational complexity of trembling hand perfection and other equilibrium refinements
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Querying probabilistic business processes for sub-flows
Proceedings of the 14th International Conference on Database Theory
On the Complexity of Nash Equilibria and Other Fixed Points
SIAM Journal on Computing
The critical-square-grid coverage problem in wireless sensor networks is NP-Complete
Computer Networks: The International Journal of Computer and Telecommunications Networking
The complexity of nash equilibria in limit-average games
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Complexity of rational and irrational Nash equilibria
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Linear index coding via semidefinite programming
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Recursive concurrent stochastic games
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Approximation algorithms for euclidean group TSP
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Recursive markov chains, stochastic grammars, and monotone systems of nonlinear equations
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Algorithmic verification of recursive probabilistic state machines
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Radial search: a simple solution approach to hard combinatorial problems
MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Verifying probabilistic procedural programs
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Model Checking of Recursive Probabilistic Systems
ACM Transactions on Computational Logic (TOCL)
Analysis of recursive probabilistic models
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Watchman tours for polygons with holes
Computational Geometry: Theory and Applications
The traveling salesman problem with few inner points
Operations Research Letters
Survey: Equilibria, fixed points, and complexity classes
Computer Science Review
The kissing problem: how to end a gathering when everyone kisses everyone else goodbye
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Watchman routes for lines and segments
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
On the Sum of Square Roots of Polynomials and Related Problems
ACM Transactions on Computation Theory (TOCT)
On the Computational Complexity of Stochastic Controller Optimization in POMDPs
ACM Transactions on Computation Theory (TOCT)
Size Constrained Distance Clustering: Separation Properties and Some Complexity Results
Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
The Gestalt heuristic: emerging abstraction to improve combinatorial search
Natural Computing: an international journal
On euclidean vehicle routing with allocation
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Watchman routes for lines and line segments
Computational Geometry: Theory and Applications
Complexity of Rational and Irrational Nash Equilibria
Theory of Computing Systems
| Hi-index | 0.00 |
We show that the STEINER TREE problem and TRAVELING SALESMAN problem for points in the plane are NP-complete when distances are measured either by the rectilinear (Manhattan) metric or by a natural discretized version of the Euclidean metric. Our proofs also indicate that the problems are NP-hard if the distance measure is the (unmodified) Euclidean metric. However, for reasons we discuss, there is some question as to whether these problems, or even the well-solved MINIMUM SPANNING TREE problem, are in NP when the distance measure is the Euclidean metric.