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 the normal view instead:
scientific article; zbMATH DE number 7967316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0.9892603158950806
0 references
0.8365963697433472
0 references
0.8361297845840454
0 references
0.8312045931816101
0 references
0.8290655612945557
0 references
