| 구분 |
IBS-KAIST 세미나 |
| 분류 |
이산수학 |
| 제목 |
Optimization via Branch Decomposition |
| Abstract |
Robertson and Seymour introduced branch-width as a connectivity invariant of graphs in their proof of the Wagner conjecture. Decompositions based on this invariant provide a natural framework for implementing dynamic-programming algorithms to solve graph optimization problems. We will discuss the computational issues involved in using branch-width as as a general tool in discrete optimization. |
| 일시 |
2025-10-21
(Tue) / 16:30 ~ 17:30 |
| 장소 |
Room B332, IBS (기초과학연구원) |
| 강연언어 |
영어 |
| 강연자성명 |
William Cook |
| 강연자소속 |
Department of Combinatorics and Optimization, Univ |
| 강연자홈페이지 |
https://www.math.uwaterloo.ca/~bico/ |
| 기타정보 |
|
| 초청인 |
Sang-il Oum |
| URL |
https://dimag.ibs.re.kr/event/2025-10-21/ |
| 담당자 |
|
| 연락처 |
|
