Facility location with dynamic distance functions
From MaRDI portal
Publication:5054838
DOI10.1007/BFb0054352zbMath1502.90105OpenAlexW1758880281MaRDI QIDQ5054838
Sudipto Guha, Randeep Bhatia, Yoram J. Sussmann, Samir Khuller
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT'98 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0054352
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- A simple heuristic for the p-centre problem
- Clustering to minimize the maximum intercluster distance
- A heuristic for the p-center problem in graphs
- Easy and hard bottleneck location problems
- Facility location with dynamic distance functions
- The p-Centre Problem-Heuristic and Optimal Algorithms
- A Best Possible Heuristic for the k-Center Problem
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Approximation Schemes for the Restricted Shortest Path Problem
- Optimal program and data locations in computer networks
- How to Allocate Network Centers
- The capacitated K-center problem
- The constrained minimum spanning tree problem
- The Location of Emergency Service Facilities
This page was built for publication: Facility location with dynamic distance functions