Università di Pisa
Sistema bibliotecario di ateneo

On uniform $k$-partition problems

Dell'Olmo, P. and Hansen, P. and Pallottino, Stefano and Storchi, G. (2003) On uniform $k$-partition problems. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

[img] Postscript (GZip) - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (126Kb)


    We study various uniform $k$-partition problems which consist in partitioning $m$ sets, each of cardinality $k$, into $k$ sets of cardinality $m$ such that each of these sets contains exactly one element from every original set. The problems differ according to the particular measure of "set uniformity" to be optimized. Most problems are polynomial and corresponding solution algorithms are provided. A few of them are proved to be NP-hard. Examples of applications to scheduling and routing problems are also discussed.

    Item Type: Book
    Uncontrolled Keywords: Partition, matrix permutation, algorithms, complexity
    Subjects: Area01 - Scienze matematiche e informatiche > INF/01 - Informatica
    Divisions: Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA
    Depositing User: dott.ssa Sandra Faita
    Date Deposited: 17 Dec 2014 16:33
    Last Modified: 17 Dec 2014 16:33
    URI: http://eprints.adm.unipi.it/id/eprint/2101

    Repository staff only actions

    View Item