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

Zeev Nutov

doi:10.1007/978-3-031-36978-0_23

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

Zeev Nutov

Computer Science

Open University of Israel

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In minimum power network design problems we are given an undirected graph G= (V, E) with edge costs { c_e: 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 language	English
Title of host publication	CiE
Editors	Gianluca Della Vedova, Besik Dundua, Steffen Lempp, Florin Manea
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	287-296
Number of pages	10
ISBN (Print)	9783031369773
DOIs	https://doi.org/10.1007/978-3-031-36978-0_23
State	Published - 2023
Event	Proceedings of the 19th International Conference on on Unity of Logic and Computation, CiE 2023 - Batumi, Georgia Duration: 24 Jul 2023 → 28 Jul 2023

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	13967 LNCS

Conference

Conference	Proceedings of the 19th International Conference on on Unity of Logic and Computation, CiE 2023
Country/Territory	Georgia
City	Batumi
Period	24/07/23 → 28/07/23

Keywords

edge disjoint st-paths
minimum power
wireless networks

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-031-36978-0_23

Cite this

Nutov, Z. (2023). An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths. In G. Della Vedova, B. Dundua, S. Lempp, & F. Manea (Eds.), CiE (pp. 287-296). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13967 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-36978-0_23

Nutov, Zeev. / An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths. CiE. editor / Gianluca Della Vedova ; Besik Dundua ; Steffen Lempp ; Florin Manea. Springer Science and Business Media Deutschland GmbH, 2023. pp. 287-296 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{cf41502f801f4ecfba1d0423080d15b2,

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

abstract = "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.",

keywords = "edge disjoint st-paths, minimum power, wireless networks",

author = "Zeev Nutov",

note = "Publisher Copyright: {\textcopyright} 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.; Proceedings of the 19th International Conference on on Unity of Logic and Computation, CiE 2023 ; Conference date: 24-07-2023 Through 28-07-2023",

year = "2023",

doi = "10.1007/978-3-031-36978-0_23",

language = "الإنجليزيّة",

isbn = "9783031369773",

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 = "287--296",

editor = "{Della Vedova}, Gianluca and Besik Dundua and Steffen Lempp and Florin Manea",

booktitle = "CiE",

address = "ألمانيا",

}

Nutov, Z 2023, An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths. in G Della Vedova, B Dundua, S Lempp & F Manea (eds), CiE. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13967 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 287-296, Proceedings of the 19th International Conference on on Unity of Logic and Computation, CiE 2023, Batumi, Georgia, 24/07/23. https://doi.org/10.1007/978-3-031-36978-0_23

An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths. / Nutov, Zeev.
CiE. ed. / Gianluca Della Vedova; Besik Dundua; Steffen Lempp; Florin Manea. Springer Science and Business Media Deutschland GmbH, 2023. p. 287-296 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13967 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Nutov, Zeev

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 - منشور من مؤتمر

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 -

Nutov Z. An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths. In Della Vedova G, Dundua B, Lempp S, Manea F, editors, CiE. Springer Science and Business Media Deutschland GmbH. 2023. p. 287-296. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-36978-0_23

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

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this