On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity

DOI10.1016/j.tcs.2008.01.029zbMath1145.68053OpenAlexW1997224618MaRDI QIDQ924146

Weili Wu, James Willson, Andras Farago, Chen Wang, Myung-Ah Park, Yongxi Cheng

Publication date: 28 May 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.01.029

zbMATH Keywords

approximation algorithms2-connectivity2-edge connectivitydual power assignment

Mathematics Subject Classification ID

Approximation algorithms (68W25) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)

Related Items (6)

An ETH-tight algorithm for bidirected Steiner connectivity ⋮ An iterative exact solution for the dual power management problem in wireless sensor network ⋮ On dual power assignment optimization for biconnectivity ⋮ Dual-based approximation algorithms for cut-based network connectivity problems ⋮ Parameterized Approximation Algorithms for Bidirected Steiner Network Problems ⋮ Dual power assignment optimization and fault tolerance in WSNs

Cites Work

• Unnamed Item
• Power consumption in packet radio networks
• Power assignment for \(k\)-connectivity in wireless ad hoc networks

This page was built for publication: On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity