A probabilistic analysis of the maximal covering location problem

DOI10.1016/0166-218X(93)90006-AzbMATH Open0778.68046OpenAlexW2025924556MaRDI QIDQ1801679FDOQ1801679

Authors: Rakesh V. Vohra, Nicholas G. Hall 

Publication date: 4 January 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90006-a

Recommendations

• A Probabilistic Analysis of the K-Location Problem
• The probabilistic 1-maximal covering problem on a network with discrete demand weights
• The Maximum Availability Location Problem
• The generalized maximal covering location problem
• The Maximal Expected Covering Location Problem: Revisited

zbMATH Keywords

heuristicsrandom modelsapproximation algorithmsrelativ error

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Title not available (Why is that?)
• The Location of Emergency Service Facilities
• Title not available (Why is that?)
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A Probabilistic Analysis of the K-Location Problem
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• Probabilistic Analysis of a Relaxation for the k-Median Problem
• Probabilistic analysis of an lp relaxation bound for the steiner problem in networks
• Title not available (Why is that?)

Cited In (14)

• Optimal approximability of bookmark assignments
• The probabilistic 1-maximal covering problem on a network with discrete demand weights
• A new chance-constrained maximum capture location problem
• The Maximum Availability Location Problem
• Probabilistic partial set covering with an oracle for chance constraints
• Tight Approximation Bounds for the Seminar Assignment Problem
• An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions
• The multimode covering location problem
• A Branch-and-Cut Algorithm for Submodular Interdiction Games
• Cut problems in graphs with a budget constraint
• A Probabilistic Analysis of the K-Location Problem
• Multimode extensions of combinatorial optimization problems
• The Maximal Expected Covering Location Problem: Revisited
• Improved approximation of maximum vertex cover

This page was built for publication: A probabilistic analysis of the maximal covering location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801679)