ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
The Effect of a Capacity Constraint on the Minimal Cost of a Partition
Full text PdfPdf (492 KB)
Source Journal of the ACM (JACM) archive
Volume 22 ,  Issue 4  (October 1975) table of contents
Pages: 441 - 449  
Year of Publication: 1975
ISSN:0004-5411
Authors
C. K. Wong  IBM Thomas J. Watson Research Center, P O. Box 218, Yorktown Heights, NY
M. C. Easton  IBM Thomas J. Watson Research Center, P O. Box 218, Yorktown Heights, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 16,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

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/321906.321907
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
CHANDRA, A. K., AND WONG, C K Worst-case analysm of a placement algorithm related to storage allocation. IBM Res Rep RC 4813, IBM Thomas J Watson Research Center, Yorktown Heights, New York, April 1974 (also SIAM J Comput , to appear, Sept. 1975).
 
2
AREY, M. R , AND JOHNSON, D S. Complexity results for multiprocessor scheduling under resource constraints SIAM J. Comput (to appear)
 
3
HARDY, G H., LITTLEWOOD, J. E., AND POLYX, G Inequalities Cambridge U Press, Cambridge, England, 1952

CITED BY
 
Eitan Bachmat , Tao Kai Lam , Avner Magen, Analysis of set-up time models: A metric perspective, Theoretical Computer Science, v.401 n.1-3, p.172-180, July, 2008

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.3 Complexity Measures and Classes
          Subjects: Reducibility and completeness

Additional Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.8 Problem Solving, Control Methods, and Search
          Subjects: Heuristic methods


General Terms:
Algorithms, Theory, Verification

Collaborative Colleagues:
C. K. Wong: colleagues
M. C. Easton: colleagues

Peer to Peer - Readers of this Article have also read:

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player