A competitive strategy for distance-aware online shape allocation

DOI10.1016/j.tcs.2014.02.050zbMath1360.68875OpenAlexW1965733606MaRDI QIDQ744054

Sándor P. Fekete, Nils Schweer, Jan-Marc Reinhardt

Publication date: 6 October 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.02.050

zbMATH Keywords

clusteringcompetitive analysisonline problemsspace-filling curvesaverage distanceoptimal shape of a city

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town?
• Space-filling curves
• Towards optimal locality in mesh-indexings
• Compact location problems
• Communication-aware processor allocation for supercomputers: Finding point sets of small average distance
• Treemaps with Bounded Aspect Ratio
• Near-Optimal Solutions to a 2-Dimensional Placement Problem
• What is the optimal shape of a city?
• A Competitive Strategy for Distance-Aware Online Shape Allocation
• Algorithms and Computation

This page was built for publication: A competitive strategy for distance-aware online shape allocation