The Voronoi game on graphs and its complexity
The Voronoi game is a two-person game which is a model for a competitive facility location. The game is played on a continuous domain, and only two special cases (one-dimensional case and one-round case) are well investigated. We introduce the discrete Voronoi game in which the game arena is given a...
Main Authors: | Teramoto, Sachio (Author), Demaine, Erik D. (Contributor), Uehara, Ryuhei (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Department of Computer Science, Brown University,
2014-04-23T20:13:37Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
The Voronoi game on graphs and its complexity
by: Teramoto, Sachio, et al.
Published: (2019) -
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
by: Demaine, Erik D., et al.
Published: (2015) -
Computational Complexity and an Integer Programming Model of Shakashaka
by: Demaine, Erik D., et al.
Published: (2015) -
Tractabilities and Intractabilities on Geometric Intersection Graphs
by: Ryuhei Uehara
Published: (2013-01-01) -
Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs
by: Demaine, Erik D, et al.
Published: (2019)