@inproceedings{78b4edfab0fa447f93cd924292e88f79,
title = "A 1.5-Approximation Algorithm for Activating Two Disjoint st-Paths",
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.",
author = "Zeev Nutov and Dawod Kahba",
note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.; 20th International Symposium on Algorithmics of Wireless Networks, ALGOWIN 2024 ; Conference date: 05-09-2024 Through 06-09-2024",
year = "2025",
doi = "https://doi.org/10.1007/978-3-031-74580-5_12",
language = "الإنجليزيّة",
isbn = "9783031745799",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "159--172",
editor = "Quentin Bramas and Arnaud Casteigts and Kitty Meeks",
booktitle = "Algorithmics of Wireless Networks - 20th International Symposium, ALGOWIN 2024, Proceedings",
address = "ألمانيا",
}