Pages that link to "Item:Q2004079"
From MaRDI portal
The following pages link to Approximation algorithm for minimum connected 3-path vertex cover (Q2004079):
Displaying 8 items.
- Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
- On approximability of connected path vertex cover (Q1644919) (← links)
- Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
- Algorithm for online 3-path vertex cover (Q2300630) (← links)
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
- The <i>k</i>‐path vertex cover: General bounds and chordal graphs (Q6087563) (← links)