Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems

DOI10.1137/1.9781611975994.63OpenAlexW3002615297MaRDI QIDQ5146834

Viswanath Nagarajan, Rohan Ghuge

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.01768

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (5)

$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm ⋮ On approximating degree-bounded network design problems ⋮ On rooted \(k\)-connectivity problems in quasi-bipartite digraphs ⋮ On rooted \(k\)-connectivity problems in quasi-bipartite digraphs ⋮ Tight bounds on subexponential time approximation of set cover and related problems

This page was built for publication: Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems