Some Theorems to Aid in Solving the File Allocation Problem

@article{Grapa1977SomeTT,
  title={Some Theorems to Aid in Solving the File Allocation Problem},
  author={Enrique Grapa and Geneva G. Belford},
  journal={Commun. ACM},
  year={1977},
  volume={20},
  pages={878-882}
}
The file allocation problem — i.e. the problem of finding the optimal set of network sites at which to locate copies of a file — is known to be, in general, polynomial complete. Heuristics and other aids to finding optimal, or near-optimal, solutions are therefore much needed. In this paper we present three theorems which can be applied a priori to indicate that certain sites should (or should not) be included in an optimal allocation. 
Highly Cited
This paper has 21 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
13 Citations
0 References
Similar Papers