Pages that link to "Item:Q5361234"
From MaRDI portal
The following pages link to Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs (Q5361234):
Displaying 8 items.
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- The complexity of mixed-connectivity (Q2070706) (← links)
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633) (← links)
- On fair covering and hitting problems (Q2672421) (← links)
- On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs (Q3190147) (← 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)
- On the partial vertex cover problem in bipartite graphs -- a parameterized perspective (Q6151150) (← links)