On approximation of dominating tree in wireless sensor networks

DOI10.1007/S11590-010-0175-0MaRDI QIDQ1958639zbMATH OpenOpenAlexFDO

Authors Incheol Shin, Yilin Shen, My T. Thai

Publication date 4 October 2010

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-010-0175-0

zbMATH Keywords

routing backbone

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Energy-Efficient Dominating Tree Construction in Wireless Ad Hoc and Sensor Networks
• Approximation algorithms for connected dominating sets
• Approximation algorithms for connected dominating sets
• On connected domination in unit ball graphs
• Algorithms for Minimum m-Connected k-Dominating Set Problem

Cites work

• A threshold of ln n for approximating set cover
• Approximating the tree and tour covers of a graph
• Approximation algorithms for connected dominating sets
• Approximation Algorithms for Directed Steiner Problems
• How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover
• Introduction to algorithms.
• On approximability of the independent/connected edge dominating set problems

Cited in

(7)

• A metaheuristic approach to the dominating tree problem
• An exact solution framework for the minimum cost dominating tree problem
• A distributed approximation algorithm for the bottleneck connected dominating set problem
• An integer programming formulation of the key management problem in wireless sensor networks
• Models for minimum cost dominating trees
• Employing (1 − ∊) Dominating Set Partitions as Backbones in Wireless Sensor Networks
• Energy-Efficient Dominating Tree Construction in Wireless Ad Hoc and Sensor Networks

This page was built for publication: On approximation of dominating tree in wireless sensor networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1958639)