On the Bidirected Cut Relaxation for Steiner Forest
- 4 June 2025
- book chapter
- Published by Springer Nature
- p. 114-127
Abstract
No abstract availableKeywords
All Related Versions
This publication has 36 references indexed in Scilit:
- Stronger MIP formulations for the Steiner forest problemMathematical Programming, 2020
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner treeMathematical Programming, 2016
- Hypergraphic LP Relaxations for Steiner TreesLecture Notes in Computer Science, 2010
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problemMathematical Programming, 2009
- A Factor 2 Approximation Algorithm for the Generalized Steiner Network ProblemCombinatorica, 2001
- A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3Journal of Algorithms, 2000
- Approximation Algorithms for Directed Steiner ProblemsJournal of Algorithms, 1999
- A New Bound for the 2-Edge Connected Subgraph ProblemLecture Notes in Computer Science, 1998
- An 11/6-approximation algorithm for the network steiner problemAlgorithmica, 1993
- A catalog of steiner tree formulationsNetworks, 1993