Pages that link to "Item:Q4240133"
From MaRDI portal
The following pages link to Approximating Node-Deletion Problems for Matroidal Properties (Q4240133):
Displaying 9 items.
- A new approach for approximating node deletion problems (Q1029021) (← links)
- A unified approximation algorithm for node-deletion problems (Q1270821) (← links)
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems (Q2354298) (← links)
- GlobaL analysis of the deiete-contract recursion for graphs and matroids (Q3320394) (← links)
- A primal-dual approach to approximation of node-deletion problems for matroidal properties (Q4572003) (← links)
- A unified local ratio approximation of node-deletion problems (Q4595485) (← links)
- Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)
- Approximating power node-deletion problems (Q6057334) (← links)