Improving construction for connected dominating set with Steiner tree in wireless sensor networks
From MaRDI portal
Publication:2505562
DOI10.1007/s10898-005-8466-1zbMath1103.90097DBLPjournals/jgo/MinDJHHW06OpenAlexW2024884029WikidataQ60402817 ScholiaQ60402817MaRDI QIDQ2505562
Weili Wu, Christina Xiao Huang, Scott C.-H. Huang, Manki Min, Xiao-Hua Jia, Hongwei David Du
Publication date: 26 September 2006
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-005-8466-1
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (26)
Minimum connected dominating sets and maximal independent sets in unit disk graphs ⋮ Flow-based formulation for the maximum leaf spanning tree problem ⋮ Leafy spanning \(k\)-forests ⋮ A distributed approximation algorithm for the bottleneck connected dominating set problem ⋮ A 3-approximation algorithm for the maximum leaf \(k\)-forest problem ⋮ A new bound on maximum independent set and minimum connected dominating set in unit disk graphs ⋮ Distributed connected dominating sets in unit square and disk graphs ⋮ Solving the multistage PMU placement problem by integer programming and equivalent network design model ⋮ Distributed dominating sets in interval graphs ⋮ Optimal deployment of indoor wireless local area networks ⋮ An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs ⋮ On the Power of Lookahead in Greedy Scheme for Finding a Minimum CDS for Unit Disk Graphs ⋮ Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem ⋮ Wireless networking, dominating and packing ⋮ An Efficient Approximation Algorithm for the Steiner Tree Problem ⋮ A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET ⋮ An exact algorithm for minimum CDS with shortest path constraint in wireless networks ⋮ EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS ⋮ TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET ⋮ Cellular Automata and Wireless Sensor Networks ⋮ Construction of strongly connected dominating sets in asymmetric multihop wireless networks ⋮ ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS ⋮ A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks ⋮ Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks ⋮ A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph ⋮ Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
Cites Work
- Unnamed Item
- Steiner tree problem with minimum number of Steiner points and bounded edge-length
- A greedy approximation for minimum connected dominating sets
- Approximation algorithms for connected dominating sets
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- Approximations for Steiner trees with minimum number of Steiner points
This page was built for publication: Improving construction for connected dominating set with Steiner tree in wireless sensor networks
