Budget constrained minimum cost connected medians

DOI10.1016/J.JDA.2004.04.006MaRDI QIDQ876728zbMATH OpenOpenAlexFDO

Authors Goran Konjevod, Sven O. Krumke, Madhav V. Marathe

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

zbMATH Keywords

medianapproximation algorithmsnetwork designNP-hardness\(k\)-median problemgroup Steiner tree problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Approximation algorithms (68W25) Continuous location (90B85)

Recommendations

• scientific article; zbMATH DE number 1696540
• Approximation algorithms for degree-constrained minimum-cost network-design problems
• Service-constrained network design problems
• scientific article; zbMATH DE number 1002205
• The constrained minimum spanning tree problem

Cites work

• scientific article; zbMATH DE number 1002205 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1256748 (Why is no real title available?)
• scientific article; zbMATH DE number 1303564 (Why is no real title available?)
• scientific article; zbMATH DE number 1163719 (Why is no real title available?)
• scientific article; zbMATH DE number 1555918 (Why is no real title available?)
• scientific article; zbMATH DE number 1559564 (Why is no real title available?)
• scientific article; zbMATH DE number 1775395 (Why is no real title available?)
• scientific article; zbMATH DE number 1405785 (Why is no real title available?)
• scientific article; zbMATH DE number 1445374 (Why is no real title available?)
• Approximation algorithms for the Geometric Covering Salesman Problem
• Competitive algorithms for distributed data management.
• Competitive distributed file allocation
• Geometric algorithms and combinatorial optimization
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Spanning Trees—Short or Small
• The Covering Salesman Problem

Cited in

(5)

• Minimizing the sum of distances to a server in a constraint network
• A deterministic algorithm for the cost-distance problem
• scientific article; zbMATH DE number 1696540 (Why is no real title available?)
• scientific article; zbMATH DE number 710577 (Why is no real title available?)
• Optimizing budget allocation for center and median points

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)