Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems

Authors:
Esther M. Arkin;Refael Hassin;Shlomi Rubinstein;Maxim Sviridenko
Affiliations:
Department of Applied Mathematics and Statistics, SUNY Stony Brook, Stony Brook, NY 11794-3600, USA;Department of Statistics and Operations Research, Tel Aviv University, Tel Aviv 69978, Israel;Department of Statistics and Operations Research, Tel Aviv University, Tel Aviv 69978, Israel;IBM T. J. Watson Research Center, Yorktown Heights, P.O. Box 218, NY 10598, USA
Venue:
Algorithmica
Year:
2004

Terminal backup, 3D matching, and covering cubic graphs

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On the maximum quadratic assignment problem

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the Maximum Quadratic Assignment Problem

Mathematics of Operations Research
A Fourier space algorithm for solving quadratic assignment problems

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Terminal Backup, 3D Matching, and Covering Cubic Graphs

SIAM Journal on Computing

Hi-index	0.00

We describe approximation algorithms for the maximum transportation with permutable supply vector and related problems.