2009/08/03 by Gershon Wolansky, Wolansky, Gershon
Computer Science · Mathematics · #62K05 #82C70 #90B06 #90C35 #Advanced Combinatorial Mathematics #Data Management and Algorithms #FOS: Mathematics #Metric Geometry (math.MG) #Optimization and Control (math.OC) #Stochastic processes and statistical mechanics #math.MG #math.OC #msc:62K05 #msc:82C70 #msc:90B06 #msc:90C35
paper · pdf · doi:10.48550/arxiv.0908.0266
7 pages
openalex publication_date 2009/08/03 · arxiv created 2009/10/15 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
It is shown that optimal network plans can be obtained, naturally, as a limit of easier problems of point allocations. These problems are obtained by minimizing the mass transportation on the set of atomic measures of prescribed number of atoms. Each of these problems can be solved by minimizing a function of a finite, prescribed number of variables.