Abstract
The approximability of multidimensional generalizations of the classical problems of multiprocessor scheduling, bin packing and the knapsack problem is investigated. Specifically, new algorithmic, as well as approximability results, are derived for the vector scheduling problem, the vector bin packing problem and a class of packing integer programs.
| Original language | English (US) |
|---|---|
| Pages | 185-194 |
| Number of pages | 10 |
| State | Published - 1999 |
| Externally published | Yes |
| Event | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA Duration: Jan 17 1999 → Jan 19 1999 |
Other
| Other | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| City | Baltimore, MD, USA |
| Period | 1/17/99 → 1/19/99 |
ASJC Scopus subject areas
- Software
- General Mathematics