The following pages link to (Q4828991):
Displayed 10 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)
- Dynamic evolution of economically preferred facilities (Q954890) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← 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)
- New algorithms for a simple measure of network partitioning (Q2700788) (← links)
- Approximating Requirement Cut via a Configuration LP (Q6084417) (← links)
- Partitioning subclasses of chordal graphs with few deletions (Q6144015) (← links)