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

zbMath0984.68197MaRDI QIDQ5949573

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

Publication date: 14 May 2002

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

Mathematics Subject Classification ID

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

Related Items (9)

An overview of graph covering and partitioning ⋮ Approximation algorithms for the maximum bounded connected bipartition problem ⋮ Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs ⋮ Max-min weight balanced connected partition ⋮ Approximation and parameterized algorithms for balanced connected partition problems ⋮ Balanced connected partitions of graphs: approximation, parameterization and lower bounds ⋮ Uniform and most uniform partitions of trees ⋮ Unnamed Item ⋮ Combinatorial approximation algorithms for the maximum bounded connected bipartition problem

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