IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i2p1612-1630.html
   My bibliography  Save this article

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

Author

Listed:
  • Rohan Ghuge

    (Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109)

  • Viswanath Nagarajan

    (Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109)

Abstract

We consider the following general network design problem. The input is an asymmetric metric ( V , c ), root r ∈ V , monotone submodular function f : 2 V → R + , 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 O ( log k log log k ) -approximation algorithm for this problem, in which k ≤ | V | is the number of vertices in an optimal solution. As a consequence, we obtain an O ( log 2 k log log k ) -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 O ( log 2 k log log k ) -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).

Suggested Citation

  • Rohan Ghuge & Viswanath Nagarajan, 2022. "Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems," Mathematics of Operations Research, INFORMS, vol. 47(2), pages 1612-1630, May.
  • Handle: RePEc:inm:ormoor:v:47:y:2022:i:2:p:1612-1630
    DOI: 10.1287/moor.2021.1181
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1181
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2021.1181?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormoor:v:47:y:2022:i:2:p:1612-1630. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.