Practical Partitioning-Based Methods for the Steiner Problem

DOI10.1007/11764298_22MaRDI QIDQ5307547zbMATH OpenOpenAlexFDO

Authors Tobias Polzin, Siavash Vahdati Daneshmand

Publication date 14 September 2007

Published in Experimental Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11764298_22

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Experimental evaluation of a partitioning algorithm for the steiner tree problem in R² and R³
• scientific article; zbMATH DE number 4128830
• A partition-based relaxation for Steiner trees
• Probabilistic partitioning algorithms for the rectilinear steiner problem
• Publication:3484640

Cited in

(11)

• Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
• Improved Steiner tree algorithms for bounded treewidth
• The searching over separators strategy to solve some NP-hard problems in subexponential time
• scientific article; zbMATH DE number 1670544 (Why is no real title available?)
• Approaches to the Steiner Problem in Networks
• Experimental evaluation of a partitioning algorithm for the steiner tree problem in R² and R³
• Implications, conflicts, and reductions for Steiner trees
• Implications, conflicts, and reductions for Steiner trees
• Solving Steiner trees: Recent advances, challenges, and perspectives
• Separator-based data reduction for signed graph balancing
• A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem

This page was built for publication: Practical Partitioning-Based Methods for the Steiner Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5307547)