劉o先、鄭o呈、賴o茗、周o霖
鄭o元、陳o安、吳o茵、曾o杰、單o晟
Book - Vazirani, Ch 29.1 to Ch 29.4, Hardness of Approximation
Paper - Euclidean Capacitated Vehicle Routing in Random Setting: A 1.55-Approximation Algorithm
王o晴、陳o仲、溫o媛、王o靜、錢o皇
Paper - Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching
黃o、李o庭、蔣o成、林o樂
Paper - A Better-Than-1.6-Approximation for Prize-Collecting TSP
陳o澤、趙o鈞、楊o詣、林o宇、廖o任
Paper - A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP
莊o喆、梁o德、F.H. (法o安)、徐o安
Book - Vazirani, Ch 7. Shortest Superstring
Paper - An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-free Two-Edge-Cover
白o偉、陳o、張o孝、陳o旭
Book - Williamson & Shmoys, Ch 4.4, 14.1. Prize-Collecting Steiner Tree
蔡o祐、林o湧、蔡o庠、蔡o霖、陳o景
Paper - 2. Stable Approximation Algorithms for Dominating Set and Independent Set
王o得、王o崴、余o佑、邱o恩、鄭o翰
Paper - Approximation Guarantees for Shortest Superstrings: Simpler and Better
麥o傑、蕭o繼、陳o聖、蔡o宸
Book - Vazirani, Ch10, Minimum Makespan Scheduling
Paper - Approximation Algorithms for Directed Weighted Spanners
劉o睿、劉o輔、蔡o睿
Paper - Improved Approximation for Two-Dimensional Vector Multiple Knapsack
Please consult with me if you plan to pick a paper that is not on the list.
** Vazirani **
Ch 6. Feedback Vertex Set
Ch 7. Shortest Superstring
Ch 10. Minimum Makespan Scheduling
Ch 11. Euclidean TSP
Ch 16. Maximum Satisfiability
Ch 18. Multicut and Integer Multicommodity Flow in Trees
Ch 21. Sparest Cut
Ch 25. k-Median
Ch 29.1 to Ch 29.4, Hardness of Approximation
** Williamson & Shmoys **
Ch 2.6, 9.3, Minimum-Degree Spanning Tree
Ch 4.4, 14.1, Prize-Collecting Steiner Tree
Ch 9.1, 9.2, Local Search for Uncapacitated Facility Location & k-Median
Ch 11.2, Minimum-Cost Bounded-Degree Spanning Trees