Optimal Networks

From MaRDI portal
Publication:6236586

arXiv1210.6228MaRDI QIDQ6236586FDOQ6236586


Authors: A. O. Ivanov, A. A. Tuzhilin Edit this on Wikidata


Publication date: 23 October 2012

Abstract: This mini-course was given in the First Yaroslavl Summer School on Discrete and Computational Geometry in August 2012, organized by International Delaunay Laboratory "Discrete and Computational Geometry" of Demidov Yaroslavl State University. The aim of this mini-course is to give an introduction in Optimal Networks theory. Optimal networks appear as solutions of the following natural problem: How to connect a finite set of points in a metric space in an optimal way? We cover three most natural types of optimal connection: spanning trees connection without additional road forks, shortest trees and locally shortest trees, and minimal fillings.













This page was built for publication: Optimal Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6236586)