Pages that link to "Item:Q2971146"
From MaRDI portal
The following pages link to The Approximability of Partial Vertex Covers in Trees (Q2971146):
Displaying 13 items.
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- Approximating the tree and tour covers of a graph (Q688437) (← links)
- Two fixed-parameter algorithms for vertex covering by paths on trees (Q963337) (← links)
- A constructive characterization of vertex cover Roman trees (Q2214322) (← links)
- Extremal cover cost and reverse cover cost of trees with given segment sequence (Q2297740) (← links)
- On the computational complexity of partial covers of theta graphs (Q2482109) (← links)
- A lower bound for the coverability problem in acyclic pushdown VAS (Q2656343) (← links)
- (Q4014421) (← links)
- Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs (Q5041208) (← links)
- On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs (Q5084707) (← links)
- Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs (Q5361234) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
- On the partial vertex cover problem in bipartite graphs -- a parameterized perspective (Q6151150) (← links)