An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths.

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


In minimum power network design problems we are given an undirected graph G= (V, E) with edge costs { ce: e∈ E}. The goal is to find an edge set F⊆ E that satisfies a prescribed property of minimum power pc(F)=∑v∈Vmax{ce:e∈Fisincidenttov}. In the Min-Power k Edge Disjoint st -Paths problem F should contain k edge disjoint st-paths. The problem admits a k-approximation algorithm, and it was an open question whether it admits an approximation ratio sublinear in k even for unit costs. We give a 42k -approximation algorithm for general costs.

Original languageEnglish
Title of host publicationCiE
EditorsGianluca Della Vedova, Besik Dundua, Steffen Lempp, Florin Manea
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages10
ISBN (Print)9783031369773
StatePublished - 2023
EventProceedings of the 19th International Conference on on Unity of Logic and Computation, CiE 2023 - Batumi, Georgia
Duration: 24 Jul 202328 Jul 2023

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13967 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceProceedings of the 19th International Conference on on Unity of Logic and Computation, CiE 2023

Bibliographical note

DBLP License: DBLP's bibliographic metadata records provided through are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.


  • edge disjoint st-paths
  • minimum power
  • wireless networks


Dive into the research topics of 'An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths.'. Together they form a unique fingerprint.

Cite this