Pages that link to "Item:Q5146830"
From MaRDI portal
The following pages link to A nearly 5/3-approximation FPT Algorithm for Min-<i>k</i>-Cut (Q5146830):
Displaying 5 items.
- Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (Q5870380) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5918433) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5925652) (← links)
- Partitioning subclasses of chordal graphs with few deletions (Q6144015) (← links)
- A parameterized approximation scheme for min \(k\)-cut (Q6654555) (← links)
