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

DOI10.1137/1.9781611975994.59MaRDI QIDQ5146830zbMATH OpenOpenAlexFDO

Authors Ken-ichi Kawarabayashi, Bingkai Lin

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)

Recommendations

• An FPT algorithm beating 2-approximation for \(k\)-cut
• Approximation algorithms for minimum \(K\)-cut
• Publication:4952694
• Fast and Deterministic Approximations for k-Cut.
• Fast and deterministic approximations for \(k\)-cut
• scientific article; zbMATH DE number 1522944
• Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts
• Fixed parameter approximation scheme for min-max \(k\)-cut
• Fixed parameter approximation scheme for min-max \(k\)-cut
• On minimum 3-cuts and approximating k-cuts using cut trees

Cited in

(6)

• 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
• A parameterized approximation scheme for min \(k\)-cut
• Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time

This page was built for publication: A nearly 5/3-approximation FPT Algorithm for Min-k-Cut

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146830)