BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20200101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20210714T170000
DTEND;TZID=Asia/Seoul:20210714T180000
DTSTAMP:20260420T061101
CREATED:20210615T091821Z
LAST-MODIFIED:20240705T184018Z
UID:4257-1626282000-1626285600@dimag.ibs.re.kr
SUMMARY:Stefan Weltge\, Integer programs with bounded subdeterminants and two nonzeros per row
DESCRIPTION:We give a strongly polynomial-time algorithm for integer linear programs defined by integer coefficient matrices whose subdeterminants are bounded by a constant and that contain at most two nonzero entries in each row. The core of our approach is the first polynomial-time algorithm for the weighted stable set problem on graphs that do not contain more than k vertex-disjoint odd cycles\, where k is any constant. Previously\, polynomial-time algorithms were only known for k=0 (bipartite graphs) and for k=1. \nWe observe that integer linear programs defined by coefficient matrices with bounded subdeterminants and two nonzeros per column can be also solved in strongly polynomial-time\, using a reduction to b-matching. \nThis is joint work with Samuel Fiorini\, Gwenaël Joret\, and Yelena Yuditsky.
URL:https://dimag.ibs.re.kr/event/2021-07-14/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
END:VCALENDAR