Integer point sets minimizing average pairwise L[subscript 1] distance: What is the optimal shape of a town?
Special issue of selected papers from the 21st Annual Canadian Conference on Computational Geometry
Main Authors: | Demaine, Erik D., Fekete, Sandor P., Rote, Günter, Schweer, Nils, Schymura, Daria, Zelke, Mariano |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Elsevier B.V.
2011
|
Online Access: | http://hdl.handle.net/1721.1/62244 https://orcid.org/0000-0003-3803-5703 |
Similar Items
-
Minimizing the average arriving distance in carpooling
by: Tianlu Zhao, et al.
Published: (2020-01-01) -
Screening synteny blocks in pairwise genome comparisons through integer programming
by: Paterson Andrew H, et al.
Published: (2011-04-01) -
Locked and Unlocked Chains of Planar Shapes
by: Connelly, Robert, et al.
Published: (2011) -
Final examination time table scheduling using integer programming with average time slot gap minimization
by: Nur Hidayah Abdul Jamil,, et al.
Published: (2024) -
Hypothesis testing using pairwise distances and associated kernels
by: Sejdinovic, D, et al.
Published: (2012)