Sum-max graph partitioning problem

DOI10.1007/978-3-642-32147-4_27MaRDI QIDQ3167634zbMATH OpenOpenAlexFDO

Authors Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König

Publication date 2 November 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://hal-lirmm.ccsd.cnrs.fr/lirmm-00738554/file/isco2012.pdf

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial optimization (90C27) Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• On the sum-max graph partitioning problem
• Fixed parameter approximation scheme for min-max \(k\)-cut
• Fixed parameter approximation scheme for min-max \(k\)-cut
• One-Half Approximation Algorithms for the k-Partition Problem
• An approximation algorithm for max k-uncut with capacity constraints

Cited in

(3)

• On the sum-max graph partitioning problem
• scientific article; zbMATH DE number 867650 (Why is no real title available?)
• Fixed parameter approximation scheme for min-max \(k\)-cut

This page was built for publication: Sum-max graph partitioning problem

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