Pages that link to "Item:Q2505562"
From MaRDI portal
The following pages link to Improving construction for connected dominating set with Steiner tree in wireless sensor networks (Q2505562):
Displaying 24 items.
- Flow-based formulation for the maximum leaf spanning tree problem (Q324785) (← links)
- Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058) (← links)
- An exact algorithm for minimum CDS with shortest path constraint in wireless networks (Q537641) (← links)
- Minimum connected dominating sets and maximal independent sets in unit disk graphs (Q818109) (← links)
- A new bound on maximum independent set and minimum connected dominating set in unit disk graphs (Q887860) (← links)
- An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs (Q906392) (← 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)
- A distributed approximation algorithm for the bottleneck connected dominating set problem (Q1926605) (← links)
- Wireless networking, dominating and packing (Q1958633) (← links)
- Leafy spanning \(k\)-forests (Q2165258) (← links)
- Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks (Q2322692) (← links)
- A 3-approximation algorithm for the maximum leaf \(k\)-forest problem (Q2413172) (← links)
- Solving the multistage PMU placement problem by integer programming and equivalent network design model (Q2423817) (← links)
- On the Power of Lookahead in Greedy Scheme for Finding a Minimum CDS for Unit Disk Graphs (Q2970204) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
- A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET (Q3569287) (← links)
- ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS (Q3634205) (← links)
- Cellular Automata and Wireless Sensor Networks (Q4686657) (← links)
- EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS (Q5189986) (← links)
- TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET (Q5189988) (← links)
- A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph (Q5244687) (← links)
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs (Q5505666) (← links)
- Optimal deployment of indoor wireless local area networks (Q6179700) (← links)