Pages that link to "Item:Q5952050"
From MaRDI portal
The following pages link to Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts (Q5952050):
Displaying 8 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)
- Efficient algorithms for the problems of enumerating cuts by non-decreasing weights (Q848944) (← links)
- Greedy splitting algorithms for approximating multiway partition problems (Q1769071) (← links)
- On generalized greedy splitting algorithms for multiway partition problems (Q1887049) (← links)
- Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- Partitioning subclasses of chordal graphs with few deletions (Q6144015) (← links)
