Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
From MaRDI portal
Publication:2232238
DOI10.1007/978-3-030-68211-8_9OpenAlexW3107177482MaRDI QIDQ2232238
Sándor P. Fekete, Linda Kleist, Jörg Kalcsics, Thomas Byrne
Publication date: 4 October 2021
Full work available at URL: https://arxiv.org/abs/2011.13275
Related Items (3)
Improved bounds for discrete Voronoi games ⋮ Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game ⋮ Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
Cites Work
- Unnamed Item
- Voronoi game on graphs
- The one-round Voronoi game replayed
- The one-round Voronoi game
- Competitive facility location: the Voronoi game
- Traveling salesmen in the presence of competition
- Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
- The Voronoi game on graphs and its complexity
- Advantage in the discrete Voronoi game
- Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand
- Nash Equilibria in Voronoi Games on Graphs
- Technical Note—Equivalence between the Direct Search Approach and the Cut Approach to the Rectilinear Distance Location Problem
- Location Science
- On the Continuous Fermat-Weber Problem
- Location of facilities with rectangular distances among point and area destinations
This page was built for publication: Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
