A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
From MaRDI portal
Publication:6663517
DOI10.1016/j.ipl.2024.106532MaRDI QIDQ6663517
Publication date: 14 January 2025
Published in: Information Processing Letters (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- On fixed cost \(k\)-flow problems
- Power optimization for connectivity problems
- On minimum power connectivity problems
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems
- Minimally k-connected graphs of low order and maximal size
- The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices
- Power consumption in packet radio networks
- On extremal \(k\)-outconnected graphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
- Detecting high log-densities
- Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth
- Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- Approximating Steiner Networks with Node-Weights
- Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
- An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
This page was built for publication: A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
