ACM Home Page
Please provide us with feedback. Feedback
Problems column
Full text PdfPdf (40 KB)
Source
ACM Transactions on Algorithms (TALG) archive
Volume 3 ,  Issue 3  (August 2007) table of contents
Article No. 35  
Year of Publication: 2007
ISSN:1549-6325
Author
Samir Khuller  University of Maryland, College Park, MD
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 53,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1273340.1273351
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
Coffman, E., Garey, M. R., Johnson, D. S., and LaPaugh, A. S. 1985. Scheduling file transfers. SIAM J. Comput. 14, 4, 743--780.
 
4
 
5
 
6
Schuurman, P., and Woeginger, G. J. 1999. Polynomial time approximation algorithms for machine scheduling: Ten open problems. J. Sched. 2, 5, 203--213.