Pages that link to "Item:Q2447765"
From MaRDI portal
The following pages link to Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem (Q2447765):
Displayed 11 items.
- Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943) (← links)
- PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
- Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← links)
- Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
- Approximation algorithm for minimum weight connected-\(k\)-subgraph cover (Q2197543) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs (Q2333163) (← links)
- Approximation Algorithm for the Minimum Connected $$k$$-Path Vertex Cover Problem (Q2942448) (← links)
- (Q5225203) (← links)
- Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)