Practical Partitioning-Based Methods for the Steiner Problem

DOI10.1007/11764298_22zbMath1196.68236OpenAlexW1747960360MaRDI QIDQ5307547

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

Related Items (7)

Separator-based data reduction for signed graph balancing ⋮ Improved Steiner tree algorithms for bounded treewidth ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm ⋮ Implications, conflicts, and reductions for Steiner trees ⋮ Implications, conflicts, and reductions for Steiner trees ⋮ Approaches to the Steiner Problem in Networks

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