题目：Co-Density and Fractional Edge Cover Packing

报告人：赵秋兰 副教授 （南京大学）

地址：腾讯会议室

时间：2021年11月23日（星期二） 8:00-8:50

摘要：Given a multigraph G=(V,E), the edge cover packing problem (ECPP) on G is to find a coloring of edges of G using the maximum number of colors such that at each vertex all colors occur. ECPP can be formulated as an integer program and is NP-hard in general. In this talk, we consider the fractional edge cover packing problem (FECPP), the LP relaxation of ECPP. We focus on the more general weighted setting, the weighted fractional edge cover packing problem (WFECPP).

腾讯会议👩‍🦰：https://meeting.tencent.com/dm/qPihd8coIGCw

会议 ID：350 455 234

All are welcome!