A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths (Q6663517)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths |
scientific article; zbMATH DE number 7967316
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths |
scientific article; zbMATH DE number 7967316 |
Statements
A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths (English)
0 references
14 January 2025
0 references
edge-disjoint st-paths
0 references
minimum power
0 references
wireless networks
0 references
approximation algorithm
0 references
0 references
0 references
0 references
