Pages that link to "Item:Q5384054"
From MaRDI portal
The following pages link to Approximation Algorithm for Sparsest <i>k</i>-Partitioning (Q5384054):
Displaying 6 items.
- Multi-way sparsest cut problem on trees with a control on the number of parts and outliers (Q2217481) (← links)
- Diffusion operator and spectral analysis for directed hypergraph Laplacian (Q2317870) (← links)
- Mean isoperimetry with control on outliers: exact and approximation algorithms (Q2672637) (← links)
- Minimum nonuniform graph partitioning with unrelated weights (Q4610203) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- Generalizing the hypergraph Laplacian via a diffusion process with mediators (Q5916256) (← links)
