Improved Steiner Tree Algorithms for Bounded Treewidth
From MaRDI portal
Publication:3111665
DOI10.1007/978-3-642-25011-8_30zbMath1349.05322WikidataQ56977107 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
Related Items
Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs, Secluded connectivity problems, Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem