%AGhuge, Rohan%ANagarajan, Viswanath%BJournal Name: Mathematics of Operations Research; Journal Volume: 47; Journal Issue: 2
%D2022%I
%JJournal Name: Mathematics of Operations Research; Journal Volume: 47; Journal Issue: 2
%K
%MOSTI ID: 10383440
%PMedium: X
%TQuasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems
%XWe consider the following general network design problem. The input is an asymmetric metric (V, c), root [Formula: see text], monotone submodular function [Formula: see text], and budget B. The goal is to find an r-rooted arborescence T of cost at most B that maximizes f(T). Our main result is a simple quasi-polynomial time [Formula: see text]-approximation algorithm for this problem, in which [Formula: see text] is the number of vertices in an optimal solution. As a consequence, we obtain an [Formula: see text]-approximation algorithm for directed (polymatroid) Steiner tree in quasi-polynomial time. We also extend our main result to a setting with additional length bounds at vertices, which leads to improved [Formula: see text]-approximation algorithms for the single-source buy-at-bulk and priority Steiner tree problems. For the usual directed Steiner tree problem, our result matches the best previous approximation ratio but improves significantly on the running time. For polymatroid Steiner tree and single-source buy-at-bulk, our result improves prior approximation ratios by a logarithmic factor. For directed priority Steiner tree, our result seems to be the first nontrivial approximation ratio. Under certain complexity assumptions, our approximation ratios are the best possible (up to constant factors).
%0Journal Article