Faster algorithms for Steiner tree and related problems: from theory to practice
From MaRDI portal
Publication:6606515
DOI10.1007/978-3-031-24907-5_3MaRDI QIDQ6606515FDOQ6606515
Authors: Daniel Rehfeldt 
Publication date: 17 September 2024
Recommendations
Cites Work
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
- Solving Steiner tree problems in graphs to optimality
- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
- Steiner tree approximation via iterative randomized rounding
- The Steiner tree problem
- A dual ascent approach for steiner tree problems on a directed graph
- Title not available (Why is that?)
- Matroids and integrality gaps for hypergraphic Steiner tree relaxations
- Fast local search for Steiner trees in graphs
- The steiner problem in graphs
- On the Exact Solution of Prize-Collecting Steiner Tree Problems
- Optimal connected subgraphs: Integer programming formulations and polyhedra
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Faster algorithm for optimum Steiner trees
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
- Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem
Cited In (1)
This page was built for publication: Faster algorithms for Steiner tree and related problems: from theory to practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606515)
