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.
CITATION STYLE
Epstein, L., & Tassa, T. (2002). Vector assignment problems: A general framework. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2461, pp. 461–473). Springer Verlag. https://doi.org/10.1007/3-540-45749-6_42
Mendeley helps you to discover research relevant for your work.