Pages that link to "Item:Q1854264"
From MaRDI portal
The following pages link to Improved methods for approximating node weighted Steiner trees and connected dominating sets. (Q1854264):
Displaying 37 items.
- The \(k\)-hop connected dominating set problem: hardness and polyhedra (Q324721) (← links)
- On the hardness of full Steiner tree problems (Q491161) (← links)
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs (Q621836) (← links)
- Sharing the cost of multicast transmissions in wireless networks (Q861267) (← links)
- Construction of strongly connected dominating sets in asymmetric multihop wireless networks (Q1006037) (← links)
- A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph (Q1006048) (← links)
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem (Q1006053) (← links)
- A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem (Q1007590) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points (Q1607061) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← links)
- The General Steiner Tree-Star problem. (Q1853139) (← links)
- 2-node-connectivity network design (Q2117701) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- Parameterized analysis of the online priority and node-weighted Steiner tree problems (Q2322716) (← links)
- Revisiting connected dominating sets: an almost optimal local information algorithm (Q2414868) (← links)
- Connecting guards with minimum Steiner points inside simple polygons (Q2419109) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- Approximation algorithms for priority Steiner tree problems (Q2695278) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks (Q3404476) (← links)
- FLOODING COUNTRIES AND DESTROYING DAMS (Q3575390) (← links)
- More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
- (Q5092436) (← links)
- Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722) (← links)
- Some results for the two disjoint connected dominating sets problem (Q5207499) (← links)
- Approximating Steiner Networks with Node Weights (Q5458547) (← links)
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs (Q5505666) (← links)
- Online Node-weighted Steiner Forest and Extensions via Disk Paintings (Q5737814) (← links)
- Approximating k-Connected m-Dominating Sets (Q5874545) (← links)
- Efficient \(k\)-shot broadcasting in radio networks (Q5962518) (← links)
- A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (Q5963614) (← links)
- The Online Broadcast Range-Assignment Problem (Q6065469) (← links)
- The online broadcast range-assignment problem (Q6088305) (← links)
- Navigational guidance -- a deep learning approach (Q6113464) (← links)
- 2-node-connectivity network design (Q6122594) (← links)