Pages that link to "Item:Q2775885"
From MaRDI portal
The following pages link to Approximation algorithms for maximization problems arising in graph partitioning (Q2775885):
Displaying 7 items.
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5919045) (← links)
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach (Q5919564) (← links)
- An approximation algorithm for the partial vertex cover problem in hypergraphs (Q5963655) (← links)
- Minimization and parameterized variants of vertex partition problems on graphs (Q6087212) (← links)
- Matroid-constrained vertex cover (Q6162073) (← links)
- A note on robust subsets of transversal matroids (Q6586976) (← links)
- Improved FPT approximation scheme and approximate kernel for biclique-free max \(k\)-weight SAT: greedy strikes back (Q6664061) (← links)