Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems
From MaRDI portal
Publication:1882632
DOI10.1007/s00453-004-1087-0zbMath1064.68092OpenAlexW2061882875MaRDI QIDQ1882632
Shlomi Rubinstein, Refael Hassin, Esther M. Arkin, M. I. Sviridenko
Publication date: 1 October 2004
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-004-1087-0
Related Items (5)
Approximation algorithms for the maximum carpool matching problem ⋮ Some good characterization results relating to the Kőnig-Egerváry theorem ⋮ Local search algorithms for the maximum carpool matching problem ⋮ A local search algorithm for binary maximum 2-path partitioning ⋮ Unnamed Item
This page was built for publication: Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems
