Minimum spanning tree with neighborhoods

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4508 LNCS, Issue , 2007, Pages 306-316

  Yang, Yang ^a   Lin, Mingen ^a   Xu, Jinhui ^a   Xie, Yulai ^a  

^a the State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

HIGHER DIMENSIONS; MINIMUM SPANNING TREE; NATURAL GENERALIZATION; NEIGHBORHOODS;

TREES (MATHEMATICS);

EID: 38149131256     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72870-2_29     Document Type: Conference Paper

References (13)

1. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms (Second Edition). MIT Press and McGraw-Hill (2001)
2. Har-Peled, S.: A replacement for voronoi diagrams of near linear size. In: FOCS. (2001) 94-103
3. Arya, S., Malamatos, T., Mount, D.M.: Space-efficient approximate voronoi diagrams. In: STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, New York, NY, USA, ACM Press (2002) 721-730
4. Wei, X., Samarabandu, J., Devdhar, R., Siegel, A., Acharya, R., Berezney, R.: Segregation of transcription and replication sites into higher order domains.
5. Arkin, E.M., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discrete Applied Mathematics 55(3) (1994) 197-218
6. Mata, C.S., Mitchell, J.S.B.: Approximation algorithms for geometric tour and network design problems (extended abstract). In: Symposium on Computational Geometry. (1995) 360-369
7. Gudmundsson, J., Levcopoulos, C.: A fast approximation algorithm for tsp with neighborhoods. Nord. J. Comput. 6(4) (1999) 469-488
8. Dumitrescu, A., Mitchell, J.S.B.: Approximation algorithms for tsp with neighborhoods in the plane. In: Proc. 12th ACM-SIAM Sympos. Discrete Algorithms (SODA). (2001) 38-46
9. de Berg, M., Gudmundsson, J., Katz, M., Levcopoulos, C., Overmars, M., van der Stappen, F.: Constant factor approximation algorithms for tspn with fat objects.
10. Mitchell, J.S.B.: A ptas for tsp with neighborhoods among fat regions in the plane. In: ACM-SIAM Symposium on Discrete Algorithms. (2007)
11. Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM 45(5) (1998) 753-782
12. Mansfield, A.: Determining the thickness of graphs is np-hard. Math. Proc. Cambridge Philos. Soc. (1983) 9-23
13. Arora, S.: Polynomial time approximation schemes for euclidean TSP and other geometric problems. In: FOCS. (1996) 2-11