Approximation of Steiner forest via the bidirected cut relaxation.
Ali ÇivrilPublished in: J. Comb. Optim. (2019)
Keyphrases
- integrality gap
- linear programming relaxation
- arbitrarily close
- lower bound
- steiner tree
- tight upper and lower bounds
- relative error
- approximation algorithms
- approximation methods
- probabilistic relaxation
- knapsack problem
- lp relaxation
- special case
- linear programming
- data mining
- iterative algorithms
- approximation ratio
- approximation error
- valid inequalities
- efficient computation
- branch and bound
- image segmentation
- information systems
- search engine
- information retrieval