Strong Steiner Tree Approximations in Practice
From MaRDI portal
Publication:4629541
DOI10.1145/3299903OpenAlexW2964184813WikidataQ128472132 ScholiaQ128472132MaRDI QIDQ4629541
Publication date: 27 March 2019
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.8318
Related Items (3)
Approximation algorithms for Steiner forest: An experimental study ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A partition-based relaxation for Steiner trees
- Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound
- The Steiner tree problem on graphs: inapproximability results
- The Steiner problem with edge lengths 1 and 2
- A fast algorithm for Steiner trees
- The Steiner tree problem
- A robust and scalable algorithm for the Steiner problem in graphs
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
- Thinning out Steiner trees: a node-based model for uniform edge costs
- A faster approximation algorithm for the Steiner tree problem in graphs
- On Steiner trees and minimum spanning trees in hypergraphs
- Improved Steiner tree algorithms for bounded treewidth
- Faster algorithm for optimum Steiner trees
- An 11/6-approximation algorithm for the network Steiner problem
- Speeding Up Dynamic Programming with Representative Sets
- Contraction-Based Steiner Tree Approximations in Practice
- A dual ascent approach for steiner tree problems on a directed graph
- Fast Algorithms for Finding Nearest Common Ancestors
- The Influence of Preprocessing on Steiner Tree Approximations
- Hypergraphic LP Relaxations for Steiner Trees
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Reduction tests for the steiner problem in grapsh
- An integer linear programming approach to the steiner problem in graphs
- Improved Approximations for the Steiner Tree Problem
- Solving Steiner tree problems in graphs to optimality
- The computation of nearly minimal Steiner trees in graphs
- A General Approximation Technique for Constrained Forest Problems
- Reducibility among Combinatorial Problems
- RNC-approximation algorithms for the steiner problem
- Tighter Bounds for Graph Steiner Tree Approximation
- Steiner Tree Approximation via Iterative Randomized Rounding
- Matroids and integrality gaps for hypergraphic steiner tree relaxations
- Steiner Minimal Trees
- The steiner problem in graphs
- An algorithm for 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: Strong Steiner Tree Approximations in Practice
