Near-Optimal Solutions to a 2-Dimensional Placement Problem
- 1 September 1975
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 4 (3), 271-286
- https://doi.org/10.1137/0204023
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A drum scheduling algorithmPublished by Springer Nature ,2006
- The Effect of a Capacity Constraint on the Minimal Cost of a PartitionJournal of the ACM, 1975
- Worst-Case Analysis of a Placement Algorithm Related to Storage AllocationSIAM Journal on Computing, 1975
- A Combinatorial Problem Related to Multimodule Memory OrganizationsJournal of the ACM, 1974
- On the Optimality of the Probability Ranking Scheme in Storage ApplicationsJournal of the ACM, 1973
- Placement of Records on a Secondary Storage Device to Minimize Access TimeJournal of the ACM, 1973
- On the near-optimality of the shortest-latency-time-first drum scheduling disciplineCommunications of the ACM, 1973
- Bounds for Weight Balanced TreesIBM Journal of Research and Development, 1973
- Minimizing expected travel time on geometrical patterns by optimal probability rearrangementsInformation and Control, 1972
- A Review of the Placement and Quadratic Assignment ProblemsSIAM Review, 1972