Pages that link to "Item:Q5505666"
From MaRDI portal
The following pages link to Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs (Q5505666):
Displaying 5 items.
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem (Q1006053) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Wireless networking, dominating and packing (Q1958633) (← links)
- Approximations for node-weighted Steiner tree in unit disk graphs (Q1958644) (← links)
- Computing a tree having a small vertex cover (Q2272400) (← links)
