Pages that link to "Item:Q4645919"
From MaRDI portal
The following pages link to On minimum 3-cuts and approximating k-cuts using Cut Trees (Q4645919):
Displaying 8 items.
- A lower bound of \(8/(7+\frac{1}{k-1})\) on the integrality ratio of the Călinescu-Karloff-Rabani relaxation for multiway cut (Q294793) (← links)
- Finding minimum 3-way cuts in hypergraphs (Q765477) (← links)
- Minimum cost subpartitions in graphs (Q845968) (← 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)
- On the \(k\)-cut problem (Q1977642) (← links)
- Efficient Algorithms for the k Smallest Cuts Enumeration (Q3511355) (← links)
- A nearly 5/3-approximation FPT Algorithm for Min-<i>k</i>-Cut (Q5146830) (← links)
