TY - JOUR

T1 - Dual power assignment via second Hamiltonian cycle

AU - Karim Abu-Affash, A.

AU - Carmi, Paz

AU - Parush Tzur, Anat

N1 - Publisher Copyright:
© 2017 Elsevier Inc.

PY - 2018/5/1

Y1 - 2018/5/1

N2 - A power assignment is an assignment of transmission power to each of the wireless nodes of a wireless network, so that the induced graph satisfies some desired properties. The cost of a power assignment is the sum of the assigned powers. In this paper, we consider the dual power assignment problem, in which each wireless node is assigned a high- or low-power level, so that the induced graph is strongly connected and the cost of the assignment is minimized. We improve the best known approximation ratio from [Formula presented]−[Formula presented]+ϵ≈1.617 to [Formula presented]≈1.571. Moreover, we show that the algorithm of Khuller et al. [11] for the strongly connected spanning subgraph problem, which achieves an approximation ratio of 1.617, is 1.522-approximation algorithm for symmetric directed graphs. The innovation of this paper is in achieving these results by using interesting conditions for the existence of a second Hamiltonian cycle.

AB - A power assignment is an assignment of transmission power to each of the wireless nodes of a wireless network, so that the induced graph satisfies some desired properties. The cost of a power assignment is the sum of the assigned powers. In this paper, we consider the dual power assignment problem, in which each wireless node is assigned a high- or low-power level, so that the induced graph is strongly connected and the cost of the assignment is minimized. We improve the best known approximation ratio from [Formula presented]−[Formula presented]+ϵ≈1.617 to [Formula presented]≈1.571. Moreover, we show that the algorithm of Khuller et al. [11] for the strongly connected spanning subgraph problem, which achieves an approximation ratio of 1.617, is 1.522-approximation algorithm for symmetric directed graphs. The innovation of this paper is in achieving these results by using interesting conditions for the existence of a second Hamiltonian cycle.

KW - Approximation algorithm

KW - Computational geometry

KW - Power assignment

UR - http://www.scopus.com/inward/record.url?scp=85034764101&partnerID=8YFLogxK

U2 - 10.1016/j.jcss.2017.10.002

DO - 10.1016/j.jcss.2017.10.002

M3 - Article

AN - SCOPUS:85034764101

VL - 93

SP - 41

EP - 53

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

SN - 0022-0000

ER -