Optimizing budget allocation for center and median points

DOI10.1016/J.TCS.2016.02.013zbMath1348.90590arXiv1406.2107OpenAlexW2282700609MaRDI QIDQ265070

Eran Omri, Boaz Ben-Moshe, Michael Elkin, Lee-Ad J. Gottlieb

Publication date: 1 April 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.2107

zbMATH Keywords

facility locationgraph radiusbudget graphscenter pointgraph optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
• Approximation algorithms for certain network improvement problems
• A network improvement problem under different norms
• Augmenting trees to meet biconnectivity and diameter constraints
• General network design: a unified view of combined location and network design problems
• Best Upgrade Plans for Large Road Networks
• Unexplored Steiner Ratios in Geometric Networks
• Location Theory
• The Weighted Euclidean 1-Center Problem
• Geometric Spanner Networks
• Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
• Upgrading trees under diameter and budget constraints
• Network upgrading problems
• Upgrading arcs to minimize the maximum travel time in a network
• Fundamentals of Computation Theory
• Capacitated facility location/network design problems.

This page was built for publication: Optimizing budget allocation for center and median points