On approximation of dominating tree in wireless sensor networks

DOI10.1007/s11590-010-0175-0zbMath1202.90266OpenAlexW2081126596MaRDI QIDQ1958639

My T. Thai, Yilin Shen, Incheol Shin

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)

Related Items

Models for minimum cost dominating trees ⋮ A metaheuristic approach to the 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 ⋮ An exact solution framework for the minimum cost dominating tree problem

Cites Work

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