Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems

DOI10.1145/3381420zbMATH Open1484.68159OpenAlexW3010770967MaRDI QIDQ4987438

Daniel Lokshtanov, Saket Saurabh, Fahad Panolan, Sudeshna Kolay, Fedor V. Fomin

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/

zbMATH Keywords

rectilinear Steiner treerectilinear Steiner arborescencesubexponential exact algorithmtreewidth algorithm

Mathematics Subject Classification ID

Could not fetch data.

Related Items (2)

Euclidean TSP in narrow strips ⋮ Polynomial time approximation scheme for the rectilinear Steiner arborescence problem

This page was built for publication: Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems

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