BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Institute of Mathematics and Informatics - ECPv6.0.8//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://math.bas.bg
X-WR-CALDESC:Събития за Institute of Mathematics and Informatics
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Sofia
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20230326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20231029T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20230721T140000
DTEND;TZID=Europe/Sofia:20230721T153000
DTSTAMP:20260509T215444
CREATED:20230719T215902Z
LAST-MODIFIED:20230719T215928Z
UID:14731-1689948000-1689953400@math.bas.bg
SUMMARY:Встъпителна лекция на доц. д-р Данила Черкашин
DESCRIPTION:В петък\, 21.07. от 14:00 в заседателната зала на ИМИ-БАН доцент Данила Черкашин ще изнесе встъпителна лекция на тема: \nGilbert—Steiner problem\nРезюме. Gilbert—Steiner problem lies in the class of mass transportation problem. Consider two finite atomic probablistic measures in the plane. The goal is to construct a network (which is an embedded forest) of the lowest price. The price functional is the some over the roads (the edges of the forest) of its capacity in the power a\, which is between 0 and 1\, mutiplied on the length. \nWe give an introduction in the problem and prove that a solution do not contain branching point of degree 4. \nЛекцията ще може да бъде проследена и в Зуум на линк https://us02web.zoom.us/j/83111372029?pwd=MzE5WGRBMHkyQWVESC9rd2ZjVlVmQT09 . \n  \n 
URL:https://math.bas.bg/event/14731/
LOCATION:Институт по математика и информатика – БАН\, Block 8\, 1113 БАН IV км.\, София\, Bulgaria
CATEGORIES:Лекция
END:VEVENT
END:VCALENDAR