On Rooted k-Connectivity Problems in Quasi-Bipartite Digraphs

Zeev Nutov ()
Additional contact information
Zeev Nutov: The Open University of Israel

SN Operations Research Forum, 2024, vol. 5, issue 1, 1-12

Abstract: Abstract We consider the directed Min-Cost Rooted Subset k -Edge-Connection problem: given a digraph $$G=(V,E)$$ G = ( V , E ) with edge costs, a set $$T \subseteq V$$ T ⊆ V of terminals, a root node r, and an integer k, find a min-cost subgraph of G that contains k edge disjoint rt-paths for all $$t \in T$$ t ∈ T . The case when every edge of positive cost has head in T admits a polynomial time algorithm due to Frank (Discret Appl Math 157(6):1242–1254, 2009), and the case when all positive cost edges are incident to r is equivalent to the k -Multicover problem. Chan et al. (APPROX/RANDOM, 2020) gave an LP-based $$O(\ln k \ln |T|)$$ O ( ln k ln | T | ) -approximation algorithm for quasi-bipartite instances, when every edge in G has at least one end in $$T \cup \{r\}$$ T ∪ { r } . We give a simple combinatorial algorithm with the same approximation ratio for a more general problem of covering an arbitrary T-intersecting supermodular set function by a min-cost edge set, and for the case when only every positive cost edge has at least one end in $$T \cup \{r\}$$ T ∪ { r } .

Keywords: Min-cost rooted k-edge-connection; Quasi-bipartite digraphs; T-intersecting supermodular set functions; Approximation algorithms (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s43069-023-00285-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:snopef:v:5:y:2024:i:1:d:10.1007_s43069-023-00285-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/43069

DOI: 10.1007/s43069-023-00285-6

Access Statistics for this article

SN Operations Research Forum is currently edited by Marco Lübbecke

More articles in SN Operations Research Forum from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().