A factoring approach for the Steiner tree problem in undirected networks
From MaRDI portal
Publication:881873
DOI10.1016/j.ins.2007.01.014zbMath1116.68065OpenAlexW2031374481MaRDI QIDQ881873
Publication date: 18 May 2007
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2007.01.014
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on A faster approximation algorithm for the Steiner problem in graphs
- Path-distance heuristic for the Steiner problem in undirected networks
- Solving Steiner tree problems in graphs with Lagrangian relaxation
- Steiner trees, partial 2–trees, and minimum IFI networks
- A dual ascent approach for steiner tree problems on a directed graph
- Universal approximations for TSP, Steiner tree, and set cover
- Problem reduction methods and a tree generation algorithm for the steiner network problem
- On finding steiner vertices
- Steiner problem in networks: A survey
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
- A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
- Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms
- Tighter Bounds for Graph Steiner Tree Approximation
- A Faster Algorithm for the Steiner Tree Problem
- Lower bounds for the relative greedy algorithm for approximating Steiner trees
- Steiner's problem in graphs and its implications
- The steiner problem in graphs
- A lower bound for the steiner tree problem in directed graphs
- An algorithm for the steiner problem in graphs
- An algorithm for the steiner problem in graphs
- A faster approximation algorithm for the Steiner problem in graphs
- Steiner tree problems
This page was built for publication: A factoring approach for the Steiner tree problem in undirected networks
