An2√k̅ -approximation algorithm for minimum powerkedge disjointst-paths
In minimum power network design problems we are given an undirected graph$G=(V,E)$with edge costs$\{c_e:e \in E\}$ . The goal is to find an edge set$F\subseteq E$that satisfies a prescribed property of minimum power$p_c(F)=\sum_{v \in V} \max \{c_e: e \in F \mbox{ is incident to } v\}$ . In the Min-...
Saved in:
| Main Author | |
|---|---|
| Format | Journal Article |
| Language | English |
| Published |
19.08.2022
|
| Subjects | |
| Online Access | Get full text |
| DOI | 10.48550/arxiv.2208.09373 |
Cover
| Summary: | In minimum power network design problems we are given an undirected graph$G=(V,E)$with edge costs$\{c_e:e \in E\}$ . The goal is to find an edge set$F\subseteq E$that satisfies a prescribed property of minimum power$p_c(F)=\sum_{v \in V} \max \{c_e: e \in F \mbox{ is incident to } v\}$ . In the Min-Power$k$Edge Disjoint$st$ -Paths problem$F$should contains$k$edge disjoint$st$ -paths. The problem admits a$k$ -approximation algorithm, and it was an open question whether it admits approximation ratio sublinear in$k$even for unit costs. We give a$2\sqrt{2k}$ -approximation algorithm for general costs. |
|---|---|
| DOI: | 10.48550/arxiv.2208.09373 |