IFIPTCS   2010 Theoretical Computer Science
Wall of Fame | Most Viewed IFIPTCS-2010 Paper
11 years 7 months ago
Approximating the Non-contiguous Multiple Organization Packing Problem
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
Marin Bougeret, Pierre-François Dutot, Klau...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source187
2Download preprint from source144
3Download preprint from source131
4Download preprint from source130
5Download preprint from source130
6Download preprint from source126
7Download preprint from source122
8Download preprint from source121
9Download preprint from source119
10Download preprint from source113
11Download preprint from source107
12Download preprint from source103