Black-box reductions convert integrality gap verifiers of non-robust LP relaxations into approximation algorithms for objective-robust discrete minimization problems.
Ravi, and Mohit Singh
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Some Black-box Reductions for Objective-robust Discrete Optimization Problems Based on their LP-Relaxations
Black-box reductions convert integrality gap verifiers of non-robust LP relaxations into approximation algorithms for objective-robust discrete minimization problems.