TY - GEN
T1 - An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths.
AU - Nutov, Zeev
N1 - Publisher Copyright:
© 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2023
Y1 - 2023
N2 - 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.
AB - 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.
KW - edge disjoint st-paths
KW - minimum power
KW - wireless networks
UR - http://www.scopus.com/inward/record.url?scp=85172412872&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-36978-0_23
DO - 10.1007/978-3-031-36978-0_23
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85172412872
SN - 9783031369773
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 287
EP - 296
BT - CiE
A2 - Della Vedova, Gianluca
A2 - Dundua, Besik
A2 - Lempp, Steffen
A2 - Manea, Florin
PB - Springer Science and Business Media Deutschland GmbH
T2 - Proceedings of the 19th International Conference on on Unity of Logic and Computation, CiE 2023
Y2 - 24 July 2023 through 28 July 2023
ER -