The following pages link to (Q3140422):
Displayed 13 items.
- Improved approximation algorithms for single-tiered relay placement (Q266064) (← links)
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements (Q336735) (← links)
- Approximating directed weighted-degree constrained networks (Q627195) (← links)
- An efficient scaling algorithm for the minimum weight bibranching problem (Q652532) (← links)
- On minimum power connectivity problems (Q972357) (← links)
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems (Q974743) (← links)
- Faster approximation algorithms for weighted triconnectivity augmentation problems (Q1267191) (← links)
- Approximations for the maximum acyclic subgraph problem (Q1332750) (← links)
- Power assignment for \(k\)-connectivity in wireless ad hoc networks (Q1781807) (← links)
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree (Q1861569) (← links)
- A fast algorithm for cactus representations of minimum cuts (Q2258383) (← links)
- (Q4520241) (← links)
- Better algorithms for minimum weight vertex-connectivity problems (Q5048953) (← links)