A nearly 5/3-approximation FPT Algorithm for Min-k-Cut

DOI10.1137/1.9781611975994.59OpenAlexW2996801447MaRDI QIDQ5146830

Bingkai Lin, Ken-ichi Kawarabayashi

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975994.59

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items

Partitioning subclasses of chordal graphs with few deletions ⋮ Partitioning subclasses of chordal graphs with few deletions ⋮ Fixed parameter approximation scheme for min-max \(k\)-cut ⋮ Fixed parameter approximation scheme for min-max \(k\)-cut ⋮ Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time