Strong Steiner tree approximations in practice
From MaRDI portal
Recommendations
Cites work
- A dual ascent approach for steiner tree problems on a directed graph
- A fast algorithm for Steiner trees
- A faster approximation algorithm for the Steiner problem in graphs
- A faster approximation algorithm for the Steiner tree problem in graphs
- A General Approximation Technique for Constrained Forest Problems
- A note on two problems in connexion with graphs
- A partition-based relaxation for Steiner trees
- A robust and scalable algorithm for the Steiner problem in graphs
- An 11/6-approximation algorithm for the network Steiner problem
- An algorithm for the steiner problem in graphs
- An integer linear programming approach to the steiner problem in graphs
- Contraction-based Steiner tree approximations in practice
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
- Fast Algorithms for Finding Nearest Common Ancestors
- Faster algorithm for optimum Steiner trees
- scientific article; zbMATH DE number 3677874 (Why is no real title available?)
- scientific article; zbMATH DE number 125502 (Why is no real title available?)
- scientific article; zbMATH DE number 1263241 (Why is no real title available?)
- scientific article; zbMATH DE number 1305435 (Why is no real title available?)
- scientific article; zbMATH DE number 1163724 (Why is no real title available?)
- scientific article; zbMATH DE number 1947441 (Why is no real title available?)
- scientific article; zbMATH DE number 2044939 (Why is no real title available?)
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 1926656 (Why is no real title available?)
- Improved algorithms for the Steiner problem in networks
- Improved Approximations for the Steiner Tree Problem
- Improved Steiner tree algorithms for bounded treewidth
- Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound
- Matroids and integrality gaps for hypergraphic Steiner tree relaxations
- On Steiner trees and minimum spanning trees in hypergraphs
- Reducibility among combinatorial problems
- Reduction tests for the steiner problem in grapsh
- RNC-approximation algorithms for the steiner problem
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Solving Steiner tree problems in graphs to optimality
- Speeding up dynamic programming with representative sets. An experimental evaluation of algorithms for Steiner Tree on tree decompositions
- Steiner Minimal Trees
- Steiner tree approximation via iterative randomized rounding
- The computation of nearly minimal Steiner trees in graphs
- The influence of preprocessing on Steiner tree approximations
- The steiner problem in graphs
- The Steiner problem with edge lengths 1 and 2
- The Steiner tree problem
- The Steiner tree problem on graphs: inapproximability results
- Thinning out Steiner trees: a node-based model for uniform edge costs
- Tighter Bounds for Graph Steiner Tree Approximation
Cited in
(10)- A parallel algorithm for computing Steiner trees in strongly chordal graphs
- Stronger MIP formulations for the Steiner forest problem
- A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract)
- Contraction-based Steiner tree approximations in practice
- Dealing with large hidden constants: engineering a planar Steiner tree PTAS
- Dealing with large hidden constants, engineering a planar Steiner tree PTAS
- Approximation algorithms for Steiner forest: An experimental study
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
- Robust Algorithms for TSP and Steiner Tree
- Solving Steiner trees: Recent advances, challenges, and perspectives
This page was built for publication: Strong Steiner tree approximations in practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629541)
