Pages that link to "Item:Q5384085"
From MaRDI portal
The following pages link to Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems (Q5384085):
Displayed 16 items.
- An approximation algorithm for maximum weight budgeted connected set cover (Q281790) (← links)
- A simple approximation algorithm for minimum weight partial connected set cover (Q1680500) (← links)
- Selective harvesting over networks (Q1741374) (← links)
- Maximum rooted connected expansion (Q2034397) (← links)
- Improved budgeted connected domination and budgeted edge-vertex domination (Q2222087) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- Algorithm and complexity of the two disjoint connected dominating sets problem on trees (Q2335669) (← links)
- On maximum leaf trees and connections to connected maximum cut problems (Q2410577) (← links)
- Revisiting connected dominating sets: an almost optimal local information algorithm (Q2414868) (← links)
- Parameterized Dynamic Variants of Red-Blue Dominating Set (Q3297772) (← links)
- (Q5005125) (← links)
- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination (Q5041206) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
- (Q5875486) (← links)
- Approximation algorithms for minimum weight partial connected set cover problem (Q5963645) (← links)