Pages that link to "Item:Q633844"
From MaRDI portal
The following pages link to Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (Q633844):
Displayed 4 items.
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- New algorithms for a simple measure of network partitioning (Q2700788) (← links)
- (Q5077149) (← links)
- Fast and Deterministic Approximations for k-Cut. (Q5875475) (← links)