Pages that link to "Item:Q406316"
From MaRDI portal
The following pages link to On the weighted \(k\)-path vertex cover problem (Q406316):
Displayed 20 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)
- An FPT algorithm for the vertex cover \(P_4\) problem (Q906446) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
- Efficient algorithm for the vertex cover \(P_k\) problem on cacti (Q1739987) (← links)
- Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← links)
- Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← links)
- Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
- A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs (Q2192977) (← links)
- The geodesic-transversal problem (Q2246468) (← links)
- An efficient local search framework for the minimum weighted vertex cover problem (Q2282264) (← links)
- Algorithm for online 3-path vertex cover (Q2300630) (← links)
- The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs (Q2333163) (← links)
- On the vertex cover \(P_3\) problem parameterized by treewidth (Q2410093) (← links)
- The k-Observer Problem on d-regular Graphs (Q5207902) (← links)
- (Q5225203) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)
- 3-path vertex cover and dissociation number of hexagonal graphs (Q5866250) (← links)
- The <i>k</i>‐path vertex cover: General bounds and chordal graphs (Q6087563) (← links)