Parameterized Approximation Algorithms for Bidirected Steiner Network Problems

DOI10.1145/3447584OpenAlexW3155138594MaRDI QIDQ5032020

Andreas Emil Feldmann, Pasin Manurangsi, Rajesh Chitnis

Publication date: 16 February 2022

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9483/

zbMATH Keywords

planar graphsstrongly connected Steiner subgraphbidirected graphsdirected Steiner networkparameterized approximations

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (1)

An ETH-tight algorithm for bidirected Steiner connectivity

This page was built for publication: Parameterized Approximation Algorithms for Bidirected Steiner Network Problems