An approach to optimal partitioning of hypergraphs

The problem of determining optimal partitions of hypergraphs ( or, more simply of ordinary graphs), is rilevant in several areas, such as computer aided design of printed boards, information retriveal and program paging. In many cases there exist optimal or near optimal partitions, subject to the constraint that each block is an LS set.