A 1.5-Approximation Algorithm for Activating Two Disjoint st-Paths

Zeev Nutov, Dawod Kahba

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

Abstract

In the ActivationkDisjointst-Paths (Activationk-DP) problem we are given a graph G=(V,E) with activation costs {cuvu,cuvv} for every edge uv∈E, a source-sink pair s,t∈V, and an integer k. The goal is to compute an edge set F⊆E of k internally node disjoint st-paths of minimum activation cost ∑v∈Vmaxuv∈Fcuvv. The problem admits an easy 2-approximation algorithm. Alqahtani & Erlebach [1] claimed that Activation 2-DP admits a 1.5-approximation algorithm. The proof in [1] has an error, and we will show that the approximation ratio of their algorithm is at least 2. We will then give a different algorithm with approximation ratio 1.5.

Original languageEnglish
Title of host publicationAlgorithmics of Wireless Networks - 20th International Symposium, ALGOWIN 2024, Proceedings
EditorsQuentin Bramas, Arnaud Casteigts, Kitty Meeks
PublisherSpringer Science and Business Media Deutschland GmbH
Pages159-172
Number of pages14
ISBN (Print)9783031745799
DOIs
StatePublished - 2025
Event20th International Symposium on Algorithmics of Wireless Networks, ALGOWIN 2024 - Egham, United Kingdom
Duration: 5 Sep 20246 Sep 2024

Publication series

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

Conference

Conference20th International Symposium on Algorithmics of Wireless Networks, ALGOWIN 2024
Country/TerritoryUnited Kingdom
CityEgham
Period5/09/246/09/24

Bibliographical note

Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

Fingerprint

Dive into the research topics of 'A 1.5-Approximation Algorithm for Activating Two Disjoint st-Paths'. Together they form a unique fingerprint.

Cite this