Pages that link to "Item:Q2197543"
From MaRDI portal
The following pages link to Approximation algorithm for minimum weight connected-\(k\)-subgraph cover (Q2197543):
Displaying 5 items.
- Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
- Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem (Q2447765) (← links)
- LATIN 2004: Theoretical Informatics (Q5901641) (← links)
- Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)
- Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs (Q6620013) (← links)