Budget constrained minimum cost connected medians
DOI10.1016/J.JDA.2004.04.006zbMATH Open1118.90017OpenAlexW1990284882MaRDI QIDQ876728FDOQ876728
Sven O. Krumke, Madhav V. Marathe, Goran Konjevod
Publication date: 26 April 2007
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2004.04.006
Recommendations
medianapproximation algorithmsnetwork designNP-hardness\(k\)-median problemgroup Steiner tree problem
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Approximation algorithms (68W25) Continuous location (90B85)
Cites Work
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- Bicriteria Network Design Problems
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Covering Salesman Problem
- Approximation algorithms for the Geometric Covering Salesman Problem
- Spanning Trees—Short or Small
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Competitive algorithms for distributed data management.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Competitive distributed file allocation
Cited In (3)
This page was built for publication: Budget constrained minimum cost connected medians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876728)
