有幾篇很有趣也有興趣看完的: - Capacity-preserving subgraphs of directed flow network - Online knapsack with removal and recourse - Generating cyclic rotation gray codes for stamp folding and semi-meander - Timeline cover in temperal graph: exact and approx. algo - Point enclosure problem for homothetic polygons
International Workshop of Combinatorial Algorithm
討論的問題是組合數學與演算法,組合數學主要討論的是圖論問題,演算法則沒有限制,有幾篇是幾何問題的演算法
- Capacity-preserving subgraphs of directed flow network
- Online knapsack with removal and recourse
- Generating cyclic rotation gray codes for stamp folding and semi-meander
- Timeline cover in temperal graph: exact and approx. algo
- Point enclosure problem for homothetic polygons