Pages that link to "Item:Q2942448"
From MaRDI portal
The following pages link to Approximation Algorithm for the Minimum Connected $$k$$-Path Vertex Cover Problem (Q2942448):
Displaying 5 items.
- A simple LP-free approximation algorithm for the minimum weight vertex cover problem (Q673599) (← links)
- An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445) (← links)
- Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
- (Q3641922) (← links)
- Approximating the minimum hub cover problem on planar graphs (Q5963689) (← links)