Thresholded Covering Algorithms for Robust and Max-min Optimization

DOI10.1007/978-3-642-14165-2_23zbMath1287.68180arXiv0912.1045OpenAlexW2115519003MaRDI QIDQ3587385

Anupam Gupta, Viswanath Nagarajan, R. Ravi

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (5)

Two-stage robust network design with exponential scenarios ⋮ Unnamed Item ⋮ Approximating max-min weighted \(T\)-joins ⋮ Robust multicovers with budgeted uncertainty ⋮ Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty

This page was built for publication: Thresholded Covering Algorithms for Robust and Max-min Optimization