The (1|1)-Centroid Problem in the Plane with Distance Constraints
From MaRDI portal
Publication:3177899
DOI10.1142/S0218195918600014zbMath1397.68211arXiv1608.03680MaRDI QIDQ3177899
Tien-Ching Lin, Hung-I Yu, Der-Tsai Lee
Publication date: 2 August 2018
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.03680
68W40: Analysis of algorithms
91A80: Applications of game theory
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
90B80: Discrete location and assignment
Cites Work
- Unnamed Item
- Unnamed Item
- On the complexity of the \((r|p)\)-centroid problem in the plane
- Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions
- Competitive location in the plane
- The leader-follower location model
- Geometric complexity of some location problems
- On locating new facilities in a competitive environment
- A linear selection algorithm for sets of elements with weights
- Sequential location problems
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Parallel Merge Sort
- Slowing down sorting networks to obtain faster sorting algorithms
- Competitive Location Models: A Framework and Bibliography
- Conditional Location Problems on Networks and in the Plane
- Static competitive facility location: an overview of optimisation approaches.
