【学术讲座】捷克西波希米亚大学Roman Čada副教授--NP-hard problems and approximability

2019年06月25日 09:31  


报告人:Roman Čada副教授

报告时间:6月25日(周二)下午4:00-5:00

报告地点:理学院楼214会议室

邀请人:李斌龙副教授

报告题目:NP-hard problems and approximability

摘要:In the talk we will deal with several typical NP-hard problems. Though all of them are hard by classification, some of them are much easier than others in the sense of possible approximation. We present some known methods used to derive approximability and discuss a background needed for showing non-approximability. We also briefly touch the problem of computability.

报告人简介:Roman Čada,捷克西波希米亚大学副教授。主要从事图论研究工作,特别是在图的闭包理论方面做出了许多研究成果。研究了重爪图的Hamilton问题,并提出了重爪图的闭包以及许多不同形式的图的闭包。在J. Combinatorics Theory Ser B、J. Graph Theory、Discreat Mathematics等图论期刊发表学术论文20余篇。

【关闭窗口】