A constant-factor approximation for quasi-bipartite directed Steiner tree on minor-free graphs

DOI10.4230/LIPICS.APPROX/RANDOM.2023.13MaRDI QIDQ6663022zbMATH OpenFDO

Authors Zachary Friggstad, Ramin Mousavi

Publication date 14 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2023.13

zbMATH Keywords

approximation algorithmscombinatorial optimizationdirected Steiner tree

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cited in

(3)

• A logarithmic integrality gap for generalizations of quasi-bipartite instances of directed Steiner tree
• A \(O(\log k)\)-approximation for \textsc{Directed Steiner Tree} in planar graphs
• From directed Steiner tree to directed polymatroid Steiner tree in planar graphs

This page was built for publication: A constant-factor approximation for quasi-bipartite directed Steiner tree on minor-free graphs

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