C.S. Mata and J. Mitchell. Approximation Algorithms for Geometric tour and network problems. In Proc. 11th ACM Symp. Comp. Geom., pp 360-369, 1995. Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents
Shortest Paths in Polygonal Domains with Polygon-Meet - Constraints Extend Ed (2003) (Correct)
Balanced Partition of Minimum Spanning Trees.. - Andersson.. (Correct)
Budget Constrained Minimum Cost Connected Medians - Konjevod, Krumke, Marathe (Correct)
Building Bridges Between Convex Regions - Ahn, Cheong, Shin (2001) (Correct)
Approximation schemes for NP-hard geometric optimization problems: .. - Arora (2002) (7 citations) (Correct)
Cylindrical Static and Kinetic Binary Space Partitions - Agarwal, Guibas, Murali.. (1997) (8 citations) (Correct)
Watchman Routes in the Presence of a Pair of Convex Polygons - Gewali, Ntafos (1995) (2 citations) (Correct)
Building Bridges Between Convex Regions - Ahn, Cheong, Shin (Correct)
Polynomial Time Approximation Schemes for Euclidean Traveling.. - Arora (1996) (166 citations) (Correct)
Shortest Point-Visible Paths on Polyhedral Surfaces - Khosravi, Ghodsi, Taghdiri (2001) (Correct)
A Fast Approximation Algorithm for TSP with.. - Gudmundsson, Levcopoulos (1997) (6 citations) (Correct)
Budget Constrained Minimum Cost Connected Medians - Konjevod, Krumke, Marathe (2000) (Correct)
Polynomial Time Approximation Schemes for Euclidean TSP and other.. - Arora (1996) (166 citations) (Correct)
Cylindrical Static and Kinetic Binary Space Partitions - Agarwal, Guibas, Murali.. (1999) (8 citations) (Correct)
A Fast Approximation Algorithm for TSP with.. - Gudmundsson, Levcopoulos (1997) (6 citations) (Correct)
Efficient Hidden-Surface Removal in Theory and in Practice - Murali (1999) (Correct)
On Simple Polygonizations with Optimal Area - Fekete (1999) (Correct)
Polynomial Time Approximation Schemes for Euclidean Traveling.. - Arora (1996) (166 citations) (Correct)
Approximation Schemes for Degree-restricted MST and Red-Blue.. - Arora, Chang (2003) (7 citations) (Correct)
On the Complexity of Approximating TSP with Neighborhoods and .. - Safra, Schwartz (Correct)
Shortest Paths with Single-Point Visibility Constraints - Khosravi, Ghodsi (Correct)
Guillotine Subdivisions Approximate Polygonal Subdivisions: A.. - Mitchell (1996) (92 citations) Self-citation (Mitchell) (Correct)
Guillotine Subdivisions Approximate Polygonal Subdivisions: Part .. - Mitchell (1997) (92 citations) Self-citation (Mitchell) (Correct)
Minimum-Link Watchman Tours - Arkin, Mitchell, Piatko (1994) Self-citation (Mitchell) (Correct)
Approximation algorithms for TSP with neighborhoods in the.. - Dumitrescu, Mitchell (2001) (7 citations) Self-citation (Mitchell) (Correct)
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC