scientific article; zbMATH DE number 1522944

MaRDI QIDQ4511240zbMATHFDO

Authors Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki

Publication date 30 October 2000

zbMATH Keywords

edge weighted undirected graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts
• scientific article; zbMATH DE number 1372653
• A divide-and-conquer approach to the minimum \(k\)-way cut problem.
• scientific article; zbMATH DE number 1342143
• On minimum 3-cuts and approximating k-cuts using cut trees

Cited in

(9)

• scientific article; zbMATH DE number 6850401 (Why is no real title available?)
• Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts
• Finding k Cuts within Twice the Optimal
• A nearly 5/3-approximation FPT Algorithm for Min-k-Cut
• A divide-and-conquer approach to the minimum \(k\)-way cut problem.
• On minimum 3-cuts and approximating k-cuts using cut trees
• Minimum cost subpartitions in graphs
• An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts
• Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem

This page was built for publication:

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