Minimizing the sum of distances to a server in a constraint network
From MaRDI portal
Publication:2330034
DOI10.1016/j.comgeo.2019.01.003zbMath1456.68221MaRDI QIDQ2330034
Paz Carmi, Lilach Chaitman-Yerushalmi, Bat-Chen Ozeri
Publication date: 18 October 2019
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2019.01.003
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
90B80: Discrete location and assignment
68W25: Approximation algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Minimum weight Euclidean \(t\)-spanner is NP-hard
- Approximating \(k\)-hop minimum spanning trees in Euclidean metrics
- Bounded-hop communication networks
- Balancing minimum spanning trees and shortest-path trees
- Average stretch factor: how low does it go?
- Approximating the average stretch factor of geometric graphs
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Geometric Spanner Networks
- Constructing minimal spanning/Steiner trees with bounded path length