Thresholded covering algorithms for robust and max-min optimization

DOI10.1007/s10107-013-0705-5zbMath1297.05188MaRDI QIDQ403674

R. Ravi, Viswanath Nagarajan, Anupam Gupta

Publication date: 29 August 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-013-0705-5

zbMATH Keywords

\(k\)-robust model; two-stage robust covering problem

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

90C27: Combinatorial optimization

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms