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 language | English |
---|---|
Title of host publication | Algorithmics of Wireless Networks - 20th International Symposium, ALGOWIN 2024, Proceedings |
Editors | Quentin Bramas, Arnaud Casteigts, Kitty Meeks |
Publisher | Springer Science and Business Media Deutschland GmbH |
Pages | 159-172 |
Number of pages | 14 |
ISBN (Print) | 9783031745799 |
DOIs | |
State | Published - 2025 |
Event | 20th International Symposium on Algorithmics of Wireless Networks, ALGOWIN 2024 - Egham, United Kingdom Duration: 5 Sep 2024 → 6 Sep 2024 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 15026 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 20th International Symposium on Algorithmics of Wireless Networks, ALGOWIN 2024 |
---|---|
Country/Territory | United Kingdom |
City | Egham |
Period | 5/09/24 → 6/09/24 |
Bibliographical note
Publisher Copyright:© The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.