Vector assignment problems: a general framework

Authors:
Leah Epstein;Tamir Tassa
Affiliations:
School of Computer Science, The Interdisciplinary Center, Herzliya, Israel;Department of Applied Mathematics, Tel Aviv University, Ramat Aviv, Tel Aviv, Israel
Venue:
Journal of Algorithms
Year:
2003

Citing 13
Cited 1

Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach

SIAM Journal on Computing
There is no asymptotic PTAS for two-dimensional vector packing

Information Processing Letters
A 13/12 approximation algorithm for bin packing with extendable bins

Information Processing Letters
Approximation schemes for scheduling

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On multi-dimensional packing problems

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for partitioning small items in unequal bins to minimize the total size

Proceedings of the third international conference on Graphs and optimization
Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices

Journal of the ACM (JACM)
Algorithms for Scheduling Independent Tasks

Journal of the ACM (JACM)
Approximation algorithms for extensible bin packing

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation Schemes for Covering and Scheduling on Related Machines

APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
A polynomial-time approximation scheme for maximizing the minimum machine completion time

Operations Research Letters

Research note: Online vector scheduling and generalized load balancing

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

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.