The following pages link to (Q2768268):
Displaying 11 items.
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (Q633844) (← links)
- Minimum cost subpartitions in graphs (Q845968) (← links)
- Approximation algorithms for requirement cut on graphs (Q848961) (← links)
- Approximating \(k\)-cuts using network strength as a Lagrangean relaxation (Q2462107) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- LP Relaxation and Tree Packing for Minimum $k$-Cut (Q3300759) (← links)
- (Q5077149) (← links)
- Fast and Deterministic Approximations for k-Cut. (Q5875475) (← links)
- Approximating Requirement Cut via a Configuration LP (Q6084417) (← links)
- Partitioning subclasses of chordal graphs with few deletions (Q6144015) (← links)
