Approximation of Steiner Forest via the Bidirected Cut Relaxation.
Ali ÇivrilPublished in: CoRR (2019)
Keyphrases
- integrality gap
- linear programming relaxation
- approximation algorithms
- linear program
- steiner tree
- lower bound
- valid inequalities
- tight upper and lower bounds
- approximation methods
- efficient computation
- probabilistic relaxation
- integer programming
- branch and bound
- polygonal approximation
- linear programming
- error bounds
- closed form
- lp relaxation
- approximation schemes
- real time