Approximation Algorithms and Hardness of Approximation for Optimization Problems

优化问题的逼近算法和逼近难度

• 批准号: RGPIN-2018-04677
• 负责人: Salavatipour, Mohammad
• 金额: $ 3.5万
• 依托单位: University of Alberta
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2021
• 资助国家: 加拿大
• 起止时间: 2021-01-01 至 2022-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=735916
• 关键词: Approximation; Algorithms; Hardness; Optimization; Problems

Approximation Algorithms; Clustering and Facility Location; Combinatorial Optimization; Computational Geometry; Hardness of Approximation; Network Design; Randomized Algorithms; Scheduling; Vehicle Routing

近似算法集群与设施选址组合优化计算几何学近似的困难;网络设计;随机算法;时间安排;车辆路径