Pages that link to "Item:Q849134"
From MaRDI portal
The following pages link to Node-weighted Steiner tree approximation in unit disk graphs (Q849134):
Displaying 14 items.
- PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs (Q411246) (← 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)
- The price of connectivity for cycle transversals (Q739064) (← links)
- Centrality measures for node-weighted networks via line graphs and the matrix exponential (Q820712) (← links)
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← links)
- Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
- Computing a tree having a small vertex cover (Q2272400) (← links)
- On the clustered Steiner tree problem (Q2355992) (← links)
- Maximum lifetime connected coverage with two active-phase sensors (Q2392753) (← links)
- A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs (Q2512658) (← links)
- Sensor Cover and Double Partition (Q2820119) (← 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)
- Approximating k-Connected m-Dominating Sets (Q5874545) (← links)
