๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Identifying Components of Max Factor

โœ Scribed by Alun Davies; Andrew Lumsden

Book ID
117607318
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
34 KB
Volume
24
Category
Article
ISSN
0896-6273

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Max-min partitioning of grid graphs into
Max-min partitioning of grid graphs into connected components
โœ Becker, Ronald; Lari, Isabella; Lucertini, Mario; Simeone, Bruno ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 197 KB ๐Ÿ‘ 2 views

The partitioning of a rectangular grid graph with weighted vertices into p connected components such that the component of smallest weight is as heavy as possible (the max-min problem) is considered. It is shown that the problem is NP-hard for rectangles with at least three rows. A shifting algorith