We present a general framework for vector assignment problems. In such problems one aims at assigning n input vectors to m machines such that the value of a given target function is minimized. While previous approaches concentrated on simple target functions such as max-max, the general approach presented here enables us to design a PTAS for a wide class of target functions. In particular we are able to deal with non-monotone target functions and asymmetric settings where the cost functions per machine may be different for different machines. This is done by combining a graph-based technique and a new technique of preprocessing the input vectors.
|Title of host publication||Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings|
|Editors||Rolf Möhring, Rajeev Raman|
|Number of pages||13|
|ISBN (Electronic)||3540441808, 9783540441809|
|State||Published - 2002|
|Event||10th Annual European Symposium on Algorithms, ESA 2002 - Rome, Italy|
Duration: 17 Sep 2002 → 21 Sep 2002
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||10th Annual European Symposium on Algorithms, ESA 2002|
|Period||17/09/02 → 21/09/02|
Bibliographical noteFunding Information:
Research supported in part by the Israel Science Foundation (Grant 250/01).
© Springer-Verlag Berlin Heidelberg 2002.