Skip to main content
Log in

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

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Esther M. Arkin, Refael Hassin, Shlomi Rubinstein or Maxim Sviridenko.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Arkin, E., Hassin, R., Rubinstein, S. et al. Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems. Algorithmica 39, 175–187 (2004). https://doi.org/10.1007/s00453-004-1087-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-004-1087-0

Navigation