Wireless networking, dominating and packing
From MaRDI portal
Publication:1958633
DOI10.1007/s11590-009-0151-8zbMath1201.90046OpenAlexW1971711522MaRDI QIDQ1958633
Weili Wu, Ding-Zhu Du, Xiaofeng Gao, Panos M. Pardalos
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-009-0151-8
Communication networks in operations research (90B18) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (16)
Minimum edge blocker dominating set problem ⋮ Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs ⋮ Maximum lifetime connected coverage with two active-phase sensors ⋮ System modeling and performance analysis of the power saving class type II in BWA networks ⋮ Making a dominating set of a graph connected ⋮ A distributed approximation algorithm for the bottleneck connected dominating set problem ⋮ An efficient approximation for minimum energy broadcast in multi-channel multi-hop wireless network with directional antennas ⋮ \(\alpha\)-coverage to extend network lifetime on wireless sensor networks ⋮ An integer programming formulation of the key management problem in wireless sensor networks ⋮ Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism ⋮ Performance analysis and evaluation of an enhanced power saving class type III in IEEE 802.16 with self-similar traffic ⋮ Topology design for on-demand dual-path routing in wireless networks ⋮ Maximum lifetime coverage preserving scheduling algorithms in sensor networks ⋮ 2-edge connected dominating sets and 2-connected dominating sets of a graph ⋮ An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube ⋮ Sensor Cover and Double Partition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Steiner tree problem with minimum number of Steiner points and bounded edge-length
- On connected domination in unit ball graphs
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
- A greedy approximation for minimum connected dominating sets
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem
- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
- Unit disk graphs
- Tight upper bounds for the domination numbers of graphs with given order and minimum degree
- Approximation algorithms for connected dominating sets
- Mathematical programming techniques for sensor networks
- Improving construction for connected dominating set with Steiner tree in wireless sensor networks
- (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
- MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS
- ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS
- Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- Approximation schemes for wireless networks
- EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
- Approximations for Steiner trees with minimum number of Steiner points
This page was built for publication: Wireless networking, dominating and packing
