Some Easy And Some Not So Easy Geometric Optimization Problems

APPROXIMATION AND ONLINE ALGORITHMS (WAOA 2018)（2018）

引用 1|浏览14

暂无评分

摘要

We survey complexity and approximability results for certain families of geometric optimization problems. We explain a generic approximation approach for maximization problems that is built around norms with polyhedral unit balls, and we pose a multitude of open problems.

查看译文

关键词

Combinatorial optimization, Approximation, Computational complexity, Geometry

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要