{"id":299,"date":"2017-04-06T17:09:47","date_gmt":"2017-04-06T08:09:47","guid":{"rendered":"http:\/\/www.opt.mist.i.u-tokyo.ac.jp\/crest-model\/?p=299"},"modified":"2017-04-06T17:09:47","modified_gmt":"2017-04-06T08:09:47","slug":"%e3%80%8c%e6%9c%80%e9%81%a9%e3%83%a2%e3%83%87%e3%83%aa%e3%83%b3%e3%82%b0%e3%80%8d%e3%82%bb%e3%83%9f%e3%83%8a%e3%83%bc%e6%a1%88%e5%86%85-420-2","status":"publish","type":"post","link":"https:\/\/www.opt.mist.i.u-tokyo.ac.jp\/crest-model\/2017\/04\/06\/%e3%80%8c%e6%9c%80%e9%81%a9%e3%83%a2%e3%83%87%e3%83%aa%e3%83%b3%e3%82%b0%e3%80%8d%e3%82%bb%e3%83%9f%e3%83%8a%e3%83%bc%e6%a1%88%e5%86%85-420-2\/","title":{"rendered":"\u300c\u6700\u9069\u30e2\u30c7\u30ea\u30f3\u30b0\u300d\u30bb\u30df\u30ca\u30fc\u6848\u5185 (4\/20)"},"content":{"rendered":"<p>\u65e5\u6642\uff1a\u30002017\u5e744\u670820\u65e5(\u6728) 16:30\uff5e17:30<br \/>\n\u5834\u6240\uff1a\u3000\u6771\u4eac\u5927\u5b66\u5de5\u5b66\u90e8 14\u53f7\u9928 5\u968e 501\u53f7\u5ba4<br \/>\n<a href=\"http:\/\/www.u-tokyo.ac.jp\/campusmap\/cam01_04_15_j.html\" target=\"_blank\" rel=\"noreferrer\">http:\/\/www.u-tokyo.ac.jp\/campusmap\/cam01_04_15_j.html<\/a><\/p>\n<p>\u8b1b\u6f14\u8005\uff1a Zoltan Szigeti (Univ. Grenoble Alpes, Grenoble INP, CNRS, G-SCOP)<\/p>\n<p>\u8b1b\u6f14\u984c\u76ee\uff1a Packing Arborescences: A Survey<\/p>\n<p>\u8b1b\u6f14\u6982\u8981\uff1a An arborescence is a directed rooted tree.<br \/>\nA packing of arborescences means arc-disjoint arborescences.<br \/>\nThis is a fundamental concept in combinatorial optimization<br \/>\nwith various applications in telecommunication, networks design,<br \/>\nevacuation problem, rigidity theory and other areas of computer science.<br \/>\nWe will provide a survey on the problem of packing arborescences.<br \/>\nEdmonds&#8217; famous result on packing spanning arborescences has been<br \/>\ngeneralized in many directions. In this talk we will focus on the<br \/>\ndirection where matroid constraints are added to the problem.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>\u65e5\u6642\uff1a\u30002017\u5e744\u670820\u65e5(\u6728) 16:30\uff5e17:30 \u5834\u6240\uff1a\u3000\u6771\u4eac\u5927\u5b66\u5de5\u5b66\u90e8 14\u53f7\u9928 5\u968e &hellip; <\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3],"tags":[],"class_list":["post-299","post","type-post","status-publish","format-standard","hentry","category-3"],"_links":{"self":[{"href":"https:\/\/www.opt.mist.i.u-tokyo.ac.jp\/crest-model\/wp-json\/wp\/v2\/posts\/299","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.opt.mist.i.u-tokyo.ac.jp\/crest-model\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.opt.mist.i.u-tokyo.ac.jp\/crest-model\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.opt.mist.i.u-tokyo.ac.jp\/crest-model\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.opt.mist.i.u-tokyo.ac.jp\/crest-model\/wp-json\/wp\/v2\/comments?post=299"}],"version-history":[{"count":0,"href":"https:\/\/www.opt.mist.i.u-tokyo.ac.jp\/crest-model\/wp-json\/wp\/v2\/posts\/299\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.opt.mist.i.u-tokyo.ac.jp\/crest-model\/wp-json\/wp\/v2\/media?parent=299"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.opt.mist.i.u-tokyo.ac.jp\/crest-model\/wp-json\/wp\/v2\/categories?post=299"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.opt.mist.i.u-tokyo.ac.jp\/crest-model\/wp-json\/wp\/v2\/tags?post=299"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}