Pages that link to "Item:Q5925652"
From MaRDI portal
The following pages link to Fixed parameter approximation scheme for min-max \(k\)-cut (Q5925652):
Displaying 6 items.
- Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639) (← links)
- Approximation algorithms for minimum \(K\)-cut (Q1977137) (← links)
- An improved fixed-parameter algorithm for max-cut parameterized by crossing number (Q2301753) (← links)
- Parameterized algorithms for graph partitioning problems (Q2408556) (← links)
- On the sum-max graph partitioning problem (Q2453173) (← links)
- A nearly 5/3-approximation FPT Algorithm for Min-<i>k</i>-Cut (Q5146830) (← links)