Pages that link to "Item:Q295639"
From MaRDI portal
The following pages link to Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639):
Displaying 3 items.
- Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance (Q1208455) (← links)
- Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (Q1702134) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
