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
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)
Approximation schemes for minimum latency problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
Network design and improvement
ACM Computing Surveys (CSUR)
A 2 + ε approximation algorithm for the k-MST problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for TSP with neighborhoods in the plane
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Optimal covering tours with turn costs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Bounded queries, approximations, and the Boolean hierarchy
Information and Computation
Competitive on-line coverage of grid environments by a mobile robot
Computational Geometry: Theory and Applications
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 Algorithms for the Minimum Bends Traveling Salesman Problem
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
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
Fast Approximation Schemes for Euclidean Multi-connectivity Problems
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Approximate TSP in Graphs with Forbidden Minors
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
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
Approximation Schemes for Geometric NP-Hard Problems: A Survey
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
TSP with Neighborhoods of Varying Size
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Euclidean bounded-degree spanning tree ratios
Proceedings of the nineteenth annual symposium on Computational geometry
Local search algorithms for the k-cardinality tree problem
Discrete Applied Mathematics
The geometric maximum traveling salesman problem
Journal of the ACM (JACM)
Journal of Experimental Algorithmics (JEA)
On the number of rectangular partitions
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for TSP with neighborhoods in the plane
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Approximation algorithms for network design with metric costs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Saving an epsilon: a 2-approximation for the k-MST problem in graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Deploying sensor networks with guaranteed capacity and fault tolerance
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
A linear-time approximation scheme for planar weighted TSP
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Improved lower and upper bounds for universal TSP in planar metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
TSP with neighborhoods of varying size
Journal of Algorithms
On the complexity of approximating tsp with neighborhoods and related problems
Computational Complexity
A subset spanner for Planar graphs,: with application to subset TSP
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The orienteering problem in the plane revisited
Proceedings of the twenty-second annual symposium on Computational geometry
Minimum-cost coverage of point sets by disks
Proceedings of the twenty-second annual symposium on Computational geometry
The number of guillotine partitions in d dimensions
Information Processing Letters
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)
On the number of rectangulations of a planar point set
Journal of Combinatorial Theory Series A
A linear time algorithm for max-min length triangulation of a convex polygon
Information Processing Letters
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem
Mathematics of Operations Research
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A PTAS for TSP with neighborhoods among fat regions in the plane
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating TSP on metrics with bounded global growth
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On clustering to minimize the sum of radii
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Degree-bounded minimum spanning trees
Discrete Applied Mathematics
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
Computational Geometry: Theory and Applications
Polychromatic 4-coloring of guillotine subdivisions
Information Processing Letters
An O(n log n) approximation scheme for Steiner tree in planar graphs
ACM Transactions on Algorithms (TALG)
The Euclidean degree-4 minimum spanning tree problem is NP-hard
Proceedings of the twenty-fifth annual symposium on Computational geometry
Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric
Computational Geometry: Theory and Applications
Communications of the ACM
A near linear time approximation scheme for Steiner tree among obstacles in the plane
Computational Geometry: Theory and Applications
On Euclidean vehicle routing with allocation
Computational Geometry: Theory and Applications
PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
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)
The number of guillotine partitions in d dimensions
Information Processing Letters
TSP with neighborhoods of varying size
Journal of Algorithms
Traveling salesman problem of segments
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Approximation schemes for degree-restricted MST and red-blue separation problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth
Proceedings of the forty-second ACM symposium on Theory of computing
Theoretical Computer Science
Proceedings of the twenty-sixth annual symposium on Computational geometry
Deploying sensor networks with guaranteed fault tolerance
IEEE/ACM Transactions on Networking (TON)
A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
Algorithmics in intensity-modulated radiation therapy
Algorithms and theory of computation handbook
Approximation algorithms for NP-hard optimization problems
Algorithms and theory of computation handbook
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Polynomial area bounds for MST embeddings of trees
Computational Geometry: Theory and Applications
Capacitated vehicle routing with non-uniform speeds
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Dealing with large hidden constants: engineering a planar steiner tree PTAS
Journal of Experimental Algorithmics (JEA)
Approximation schemes for capacitated geometric network design
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
Journal of the ACM (JACM)
On the area requirements of Euclidean minimum spanning trees
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Exploring and triangulating a region by a swarm of robots
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Approximation of octilinear steiner trees constrained by hard and soft obstacles
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Approximation algorithms for euclidean group TSP
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Delineating boundaries for imprecise regions
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
An upper bound on the number of rectangulations of a point set
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Euclidean prize-collecting steiner forest
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Hardness and approximation of octilinear steiner trees
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximation schemes for node-weighted geometric steiner tree problems
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
On approximating the TSP with intersecting neighborhoods
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Shape rectangularization problems in intensity-modulated radiation therapy
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
An improved strategy for exploring a grid polygon
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Efficient data collection from wireless nodes under the two-ring communication model
International Journal of Robotics Research
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The traveling salesman problem with few inner points
Operations Research Letters
Survey: A survey on relay placement with runtime and approximation guarantees
Computer Science Review
Minimum covering with travel cost
Journal of Combinatorial Optimization
On Clustering to Minimize the Sum of Radii
SIAM Journal on Computing
Technical Note---Approximation Algorithms for VRP with Stochastic Demands
Operations Research
A probabilistic analysis of christofides' algorithm
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
A near linear time approximation scheme for steiner tree among obstacles in the plane
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
On euclidean vehicle routing with allocation
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
On the area requirements of Euclidean minimum spanning trees
Computational Geometry: Theory and Applications
| Hi-index | 0.02 |
We show that any polygonal subdivision in the plane can be converted into an "m-guillotine" subdivision whose length is at most $(1+{c\over m})$ times that of the original subdivision, for a small constant c. "m-Guillotine" subdivisions have a simple recursive structure that allows one to search for the shortest of such subdivisions in polynomial time, using dynamic programming. In particular, a consequence of our main theorem is a simple polynomial-time approximation scheme for geometric instances of several network optimization problems, including the Steiner minimum spanning tree, the traveling salesperson problem (TSP), and the k-MST problem.