Probabilistic Analysis of the Planar k-Median Problem
From MaRDI portal
Publication:3875687
DOI10.1287/moor.5.1.27zbMath0435.90057MaRDI QIDQ3875687
Dorit S. Hochbaum, Marshall L. Fisher
Publication date: 1980
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.5.1.27
asymptotic behavior; probabilistic analysis; location; aggregation heuristic; epsilon- optimality; growth of optimal value; planar K-median problem; relationship to problem size
68Q25: Analysis of algorithms and problem complexity
90B99: Operations research and management science
Related Items
Competitive location in the plane, Worst-case analysis of demand point aggregation for the Euclidean \(p\)-median problem, A comparison of two dual-based procedures for solving the p-median problem, Maximal paths in random dynamic graphs, Probabilistic analysis of some Euclidean clustering problems, Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations, An appraisal of computational complexity for operations researchers, Average performance of greedy heuristics for the integer knapsack problem., Heuristic methods and applications: A categorized survey, The simple plant location problem: Survey and synthesis, A Probabilistic Analysis of the K-Location Problem, Probabilistic Analysis of Geometric Location Problems
