Voronoi game on graphs and its complexity

Proceedings of the 2006 IEEE Symposium on Computational Intelligence and Games, CIG'06

Volumn , Issue , 2006, Pages 265-271

  Teramoto, Sachio ^a   Demaine, Erik D ^b   Uehara, Ryuhei ^a  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Graphs; k trees; NP completeness; PSPACE completeness; Voronoi game

Indexed keywords

ARTIFICIAL INTELLIGENCE;

GRAPHS; K-TREES; NP-COMPLETENESS; PSPACE COMPLETENESS; VORONOI;

TREES (MATHEMATICS);

EID: 45149086377     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIG.2006.311711     Document Type: Conference Paper

References (6)

1. H.-K. Ahn. S.-W. Cheng, O. Cheong, M. Golin, R. van Oostrum. Competitive facility location: the Voronoi game, Theoretical Computer Science, vol. 310, pp. 457-467, 2004.
2. O. Cheong, S. Har-Peled, N. Linial, J. Matousek. The one-round Voronoi game. Discrete and Computational Geometry, vol. 31, pp. 125-138, 2004.
3. S. P. Fekete, H. Meijer. The one-round Voronoi game replayed: Computational Geometry Theory and Applications, vol. 30, pp. 81-94, 2005.
4. F. Harary. Graph Theory, Addison-Wesley, 1972.
5. C. H. Papadimitriou. Computational Complexity. Addison-Wesley Publishing Company, 1994.
6. T. J. Schaefer. On the Complexity of Some Two-Person Perfect-Information Games, Journal of Computer and System Sciences, Vol. 16, pp. 185-225, 1978.