Pages that link to "Item:Q4446911"
From MaRDI portal
The following pages link to A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks (Q4446911):
Displayed 50 items.
- Minimum edge blocker dominating set problem (Q319914) (← links)
- Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (Q331973) (← links)
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph (Q405692) (← links)
- Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks (Q437049) (← links)
- Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058) (← links)
- Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks (Q443711) (← links)
- The within-strip discrete unit disk cover problem (Q528480) (← links)
- Capacitated domination problem (Q534769) (← links)
- On connected domination in unit ball graphs (Q537633) (← links)
- An exact algorithm for minimum CDS with shortest path constraint in wireless networks (Q537641) (← links)
- Polynomial time approximation schemes for minimum disk cover problems (Q613664) (← links)
- Connected dominating sets on dynamic geometric graphs (Q691774) (← links)
- A greedy approximation for minimum connected dominating sets (Q706637) (← links)
- A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network (Q724732) (← links)
- An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube (Q747485) (← links)
- Minimum connected dominating sets and maximal independent sets in unit disk graphs (Q818109) (← links)
- Approximating minimum independent dominating sets in wireless networks (Q975555) (← links)
- Construction of strongly connected dominating sets in asymmetric multihop wireless networks (Q1006037) (← links)
- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks (Q1037372) (← links)
- PTAS for connected vertex cover in unit disk graphs (Q1040582) (← links)
- Bank supervision using the threshold-minimum dominating set (Q1619369) (← links)
- Two algorithms for minimum 2-connected \(r\)-hop dominating set (Q1675775) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- Complexity and lowers bounds for power edge set problem (Q1711663) (← links)
- Locating battery charging stations to facilitate almost shortest paths (Q1720301) (← links)
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← links)
- PTAS for the minimum weighted dominating set in growth bounded graphs (Q1928314) (← links)
- A PTAS for minimum \(d\)-hop connected dominating set in growth-bounded graphs (Q1958631) (← links)
- Wireless networking, dominating and packing (Q1958633) (← links)
- Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- A game theoretic approach for minimal connected dominating set (Q2193269) (← links)
- Computing a tree having a small vertex cover (Q2272400) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- On the approximability and hardness of the minimum connected dominating set with routing cost constraint (Q2326407) (← links)
- On connected dominating sets of restricted diameter (Q2356248) (← links)
- PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs (Q2392763) (← links)
- Routing-efficient CDS construction in disk-containment graphs (Q2448125) (← links)
- On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs (Q2456357) (← links)
- Improving construction for connected dominating set with Steiner tree in wireless sensor networks (Q2505562) (← links)
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs (Q2700783) (← links)
- Approximate Aggregation for Tracking Quantiles in Wireless Sensor Networks (Q2942390) (← links)
- On the Power of Lookahead in Greedy Scheme for Finding a Minimum CDS for Unit Disk Graphs (Q2970204) (← links)
- (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs (Q3511366) (← links)
- Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs (Q3602842) (← links)
- MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS (Q3634203) (← links)
- Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs (Q4605337) (← links)
- Cellular Automata and Wireless Sensor Networks (Q4686657) (← links)
- Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set (Q4989343) (← links)
- (Q5090485) (← links)