Dual power assignment via second Hamiltonian cycle

DOI10.1016/j.jcss.2017.10.002zbMath1383.68062arXiv1402.5783OpenAlexW2962764081MaRDI QIDQ1686228

Paz Carmi, A. Karim Abu-Affash, Anat Parush Tzur

Publication date: 21 December 2017

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.5783

zbMATH Keywords

approximation algorithmcomputational geometrypower assignment

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items

Approximation algorithm for receiver interference problem in dual power wireless sensor networks

Cites Work

• Unnamed Item
• Unnamed Item
• Power assignment in radio networks with two power levels
• Wireless network design via 3-decompositions
• Independent dominating sets and a second hamiltonian cycle in regular graphs
• Power consumption in packet radio networks
• On strongly connected digraphs with bounded cycle length
• Approximating Transitive Reductions for Directed Networks
• Independent dominating sets and hamiltonian cycles
• Min-Power Strong Connectivity
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
• Approximating the Minimum Equivalent Digraph
• On Hamiltonian Circuits