A Probabilistic Analysis of the K-Location Problem

DOI10.1080/01966324.1992.10737326zbMath0776.90046OpenAlexW2114456203WikidataQ58279816 ScholiaQ58279816MaRDI QIDQ3136634

Dean P. Foster, Rakesh V. Vohra

Publication date: 20 October 1993

Published in: American Journal of Mathematical and Management Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01966324.1992.10737326

zbMATH Keywords

probabilistic analysis\(K\)-location problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items

Continuous approximation formulas for location problems, A probabilistic analysis of the maximal covering location problem

Cites Work

• Unnamed Item
• Unnamed Item
• Probabilistic Analysis of Geometric Location Problems
• Probabilistic Analysis of the Planar k-Median Problem
• Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Steinhaus's geometric location problem for random samples in the plane
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• An analysis of approximations for maximizing submodular set functions—I
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• A Concentration Inequality for the K-Median Problem