Improved Steiner Tree Algorithms for Bounded Treewidth

DOI10.1007/978-3-642-25011-8_30zbMath1349.05322DBLPconf/iwoca/ChimaniMZ11OpenAlexW2178959785WikidataQ56977107 ScholiaQ56977107MaRDI QIDQ3111665

Bernd Zey, Petra Mutzel, Markus Chimani

Publication date: 13 January 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25011-8_30

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Secluded connectivity problems ⋮ Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs ⋮ Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem

This page was built for publication: Improved Steiner Tree Algorithms for Bounded Treewidth