Vector assignment problems: A general framework

Leah Epstei, Tamir Tassa

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

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 polynomial time approximation scheme (PTAS) for a wide class of target functions. In particular, thanks to a novel technique of preprocessing the input vectors, we are able to deal with nonmonotone target functions. Such target functions arise in vector assignment problems in the context of video transmission and broadcasting.

Original languageEnglish
Pages (from-to)360-384
Number of pages25
JournalJournal of Algorithms
Volume48
Issue number2
DOIs
StatePublished - 1 Jan 2003
Externally publishedYes

Keywords

  • Approximation schemes
  • Bin packing
  • Makespan
  • Optimization
  • PTAS
  • Scheduling

Fingerprint

Dive into the research topics of 'Vector assignment problems: A general framework'. Together they form a unique fingerprint.

Cite this