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, Demaine, Erik D, Uehara, Ryuhei |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
Journal of Graph Algorithms and Applications
2019
|
Online Access: | https://hdl.handle.net/1721.1/121515 |
Similar Items
-
The Voronoi game on graphs and its complexity
by: Teramoto, Sachio, et al.
Published: (2014) -
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) -
The graph isomorphism problem on geometric graphs
by: Ryuhei Uehara
Published: (2014-10-01) -
Algorithmic folding complexity
by: Cardinal, Jean, et al.
Published: (2011)