Host:
HCP (Workshop on Hard Computational Problems: Theory , Algorithms and Applications)
Time:
- 13:00-19:00 (Time in Beijing)
- May 27, 2022 (Friday)
Venue:
Online, Tencent Meeting (ID: 267-356-071)
Agenda:
| Title | Authors |
| Optimizing Binary Decision Diagrams with MaxSAT for classification | Hao Hu, Mohamed Siala, Marie-José Huguet |
| Encoding Multi-valued Decision Diagram Constraints as Binary Constraint Trees | Ruiwei Wang, Roland H. C. Yap |
| A First Mathematical Runtime Analysis of the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) | Weijie Zheng, Yufei Liu, Benjamin Doerr |
| 15 mins Break | |
| Improving Local Search Algorithms via Probabilistic Configuration Checking | Weilin Luo, Hai Wan, Rongzhen Ye, Shaowei Cai, Biqing Fang, Delong Zhang |
| NukCP: An Improved Local Search Algorithm for Maximum k-Club Problem | Jiejiang Chen, Yiyuan Wang, Shaowei Cai, Minghao Yin, Yupeng Zhou, Wu jieyu. |
| A Fast Local Search Algorithm for the Latin Square Completion Problem | Shiwei Pan, Yiyuan Wang, Minghao Yin |
| An Exact Algorithm with New Upper Bounds for the Maximum k-Defective Clique Problem in Massive Sparse Graphs. | Jian Gao, Zhenghang Xu, Ruizhi Li, Minghao Yin |
For more information, Click here.