A practical greedy approximation for the directed Steiner tree problem
From MaRDI portal
Publication:346528
DOI10.1007/S10878-016-0074-0zbMATH Open1356.90151OpenAlexW2518649733MaRDI QIDQ346528FDOQ346528
Authors: Dimitri Watel, Marc-Antoine Weisser 
Publication date: 29 November 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0074-0
Recommendations
- A practical greedy approximation for the directed Steiner tree problem
- Multi-rooted greedy approximation of directed Steiner trees with applications
- Multi-rooted greedy approximation of directed Steiner trees with applications
- scientific article; zbMATH DE number 1303557
- Approximation Algorithms for Directed Steiner Problems
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- A threshold of ln n for approximating set cover
- A Greedy Heuristic for the Set-Covering Problem
- Title not available (Why is that?)
- An 11/6-approximation algorithm for the network Steiner problem
- Polylogarithmic inapproximability
- Approximation Algorithms for Directed Steiner Problems
- Steiner tree approximation via iterative randomized rounding
- A series of approximation algorithms for the acyclic directed Steiner tree problem
- Steiner tree problems in telecommunications
- A dual ascent approach for steiner tree problems on a directed graph
- Title not available (Why is that?)
- A fast algorithm for Steiner trees
- An improved approximation scheme for the Group Steiner Problem
- Dual heuristics on the exact solution of large Steiner problems
- A practical greedy approximation for the directed Steiner tree problem
- Contraction-based Steiner tree approximations in practice
- Title not available (Why is that?)
- A distributed dual ascent algorithm for Steiner problems in multicast routing
- Fast local search for Steiner trees in graphs
- A note on distributed multicast routing in point-to-point networks
Cited In (10)
- Multi-rooted greedy approximation of directed Steiner trees with applications
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes
- A practical greedy approximation for the directed Steiner tree problem
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences
- Multi-rooted greedy approximation of directed Steiner trees with applications
- A linear programming based approach to the Steiner tree problem with a fixed number of terminals
- Linear Programming Hierarchies Suffice for Directed Steiner Tree
- Navigational guidance -- a deep learning approach
Uses Software
This page was built for publication: A practical greedy approximation for the directed Steiner tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346528)
