Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems
From MaRDI portal
Publication:4987438
DOI10.1145/3381420zbMath1484.68159MaRDI QIDQ4987438
Fedor V. Fomin, Saket Saurabh, Daniel Lokshtanov, Fahad Panolan, Sudeshna Kolay
Publication date: 3 May 2021
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/5931/
rectilinear Steiner tree; rectilinear Steiner arborescence; subexponential exact algorithm; treewidth algorithm
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C85: Graph algorithms (graph-theoretic aspects)
