Near-Optimal Solutions to a 2-Dimensional Placement Problem
From MaRDI portal
Publication:4127390
DOI10.1137/0204023zbMath0355.68044OpenAlexW1996431814MaRDI QIDQ4127390
No author found.
Publication date: 1975
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0204023
Related Items (8)
A continuous districting model focusing on intra‐ and inter‐zonal squared distances and its Voronoi‐based heuristic ⋮ Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? ⋮ One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations ⋮ Optimization and approximation algorithm for placement of records on linear storage devices ⋮ Near-optimal heuristics for an assignment problem in mass storage ⋮ Optimal shape of a blob ⋮ Communication-aware processor allocation for supercomputers: Finding point sets of small average distance ⋮ A competitive strategy for distance-aware online shape allocation
This page was built for publication: Near-Optimal Solutions to a 2-Dimensional Placement Problem
