Advantage in the discrete Voronoi game
From MaRDI portal
Publication:2929591
DOI10.7155/jgaa.00331zbMath1302.05118arXiv1303.0523OpenAlexW2090004555MaRDI QIDQ2929591
Dömötör Pálvölgyi, Alexey Pokrovskiy, Dániel Gerbner, Günter Rote, Viola Mészáros
Publication date: 13 November 2014
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.0523
Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (4)
The discrete Voronoi game in \(\mathbb{R}^2\) ⋮ Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game ⋮ The inverse Voronoi problem in graphs. I: Hardness ⋮ Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
Uses Software
This page was built for publication: Advantage in the discrete Voronoi game
