The Influence of Preprocessing on Steiner Tree Approximations
From MaRDI portal
Publication:3467874
DOI10.1007/978-3-319-26626-8_44zbMath1473.68117OpenAlexW2395552018MaRDI QIDQ3467874
Publication date: 5 February 2016
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_44
Related Items (2)
Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Strong Steiner Tree Approximations in Practice
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast algorithm for Steiner trees
- A robust and scalable algorithm for the Steiner problem in graphs
- Thinning out Steiner trees: a node-based model for uniform edge costs
- A faster approximation algorithm for the Steiner tree problem in graphs
- An 11/6-approximation algorithm for the network Steiner problem
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Contraction-Based Steiner Tree Approximations in Practice
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- Tighter Bounds for Graph Steiner Tree Approximation
- Steiner Tree Approximation via Iterative Randomized Rounding
- Matroids and integrality gaps for hypergraphic steiner tree relaxations
- The steiner problem in graphs
- A faster approximation algorithm for the Steiner problem in graphs
- Improved algorithms for the Steiner problem in networks
This page was built for publication: The Influence of Preprocessing on Steiner Tree Approximations