The one-round Voronoi game replayed

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

Volumn 2748, Issue , 2003, Pages 150-161

  Fekete, Sándor P ^a   Meijer, Henk ^b  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

^b QUEEN S UNIVERSITY   (Canada)

Author keywords

Competitive facility location; Computational geometry; NP hardness; Voronoi diagram; Voronoi game

Indexed keywords

COMPUTATIONAL GEOMETRY;

COMPETITIVE FACILITY LOCATION; NP-HARD; NP-HARDNESS; RECTANGULAR AREA; VORONOI; VORONOI DIAGRAMS; WINNING STRATEGY;

ASPECT RATIO;

EID: 21144438576     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45078-8_14     Document Type: Article

References (11)

1. H.-K. Ahn, S.-W. Cheng, O. Cheong, M. Golin, and R. van Oostrum. Competitive facility location along a highway. In Proceedings of the Ninth Annual International Computing and Combinatorics Conference, volume 2108, pages 237-246, 2001.
2. O. Cheong, S. Har-Peled, N. Linial, and J. Matousek. The one-round voronoi game. In Proceedings of the Eighteenth Annual ACM Symposium on Computational Geometry, pages 97-101, 2002.
3. F. Dehne, R. Klein, and R. Seidel. Maximizing a Voronoi region: The convex case. In Proceedings of the Thirteenth Annual International Symposium on Algorithms and Computation, volume 2518, pages 624-634, 2001.
4. H. Eiselt and G. Laporte. Competitive spatial models. European Journal of Operational Research, 39:231-242, 1989.
5. H. Eiselt, G. Laporte, and J.-F. Thisse. Competitive location models: A framework and bibliography. Transportation Science, 27:44-54, 1993.
6. S. P. Fekete, J. S. B. Mitchell, and K. Weinbrecht. On the continuous Weber and k-median problems. In Proceedings of the Sixteenth Annual ACM Symposium on Computational Geometry, pages 70-79, 2000.
7. T. Friesz, R. Tobin, and T. Miller. Existence theory for spatially competitive network facility location models. Annals of Operations Research, 18:267-276, 1989.
8. D. Lichtenstein. Planar formulae and their uses. SIAM Journal on Computing, 11, 2:329-343, 1982.
9. D. Lichtenstein and M. Sipser. Go is polynomial-space hard. Journal of the ACM, 27:393-401, 1980.
10. J. Robson. The complexity of go. In Information Processing: Proceedings of IFIP Congerss, pages 413-4417, 1983.
11. P. Rosenstiehl and R. E. Tarjan. Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete and Computational Geometry, 1:343-353, 1986.