Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems
From MaRDI portal
Publication:3132873
DOI10.4230/LIPIcs.SoCG.2016.39zbMath1387.68180OpenAlexW2472796018MaRDI QIDQ3132873
Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Fedor V. Fomin, Saket Saurabh
Publication date: 30 January 2018
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/5931/pdf/LIPIcs-SoCG-2016-39.pdf/
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane ⋮ Finding even subgraphs even faster ⋮ Unnamed Item ⋮ A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs ⋮ Unnamed Item ⋮ The complexity of tree partitioning ⋮ Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) ⋮ Path-Contractions, Edge Deletions and Connectivity Preservation
This page was built for publication: Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems
