Develops constant-factor approximations for parity-constrained facility location and k-center by solving the unconstrained version then correcting parity violations via a T-join on a shortcutted auxiliary graph.
Title resolution pending
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
-
Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location Problems
Develops constant-factor approximations for parity-constrained facility location and k-center by solving the unconstrained version then correcting parity violations via a T-join on a shortcutted auxiliary graph.