Pages that link to "Item:Q5283370"
From MaRDI portal
The following pages link to Approximating Bounded Degree Deletion via Matroid Matching (Q5283370):
Displaying 7 items.
- Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
- Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs (Q2193275) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- Approximating power node-deletion problems (Q6593676) (← links)
- Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints (Q6657233) (← links)
