A polynomial-time algorithm for max-min partitioning of ladders

MaRDI QIDQ5949573zbMATH OpenFDO

Authors Ronald I. Becker, Isabella Lari, Mario Lucertini, Bruno Simeone

Publication date 14 May 2002

Published in Theory of Computing Systems (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Max-min partitioning of grid graphs into connected components
• A 7/6-approximation algorithm for the max-min connected bipartition problem on grid graphs
• scientific article; zbMATH DE number 3970117
• On a 2-dimensional equipartition problem
• Graph-Theoretic Concepts in Computer Science

Cited in

(12)

• Uniform and most uniform partitions of trees
• Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
• An overview of graph covering and partitioning
• Approximation algorithms for the maximum bounded connected bipartition problem
• Investigation of maximum and minimum satisfiability problems using \(L\)-partition
• Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs
• Max-min weight balanced connected partition
• Max-min partitioning of grid graphs into connected components
• scientific article; zbMATH DE number 2230227 (Why is no real title available?)
• Approximation and parameterized algorithms for balanced connected partition problems
• Balanced connected partitions of graphs: approximation, parameterization and lower bounds
• An analysis of the LPT algorithm for the max-min and the min-ratio partition problems

This page was built for publication: A polynomial-time algorithm for max-min partitioning of ladders

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