Combinatorial Optimization Problems in Geometric Settings

Combinatorial Optimization Problems in Geometric Settings(2013)

引用 23|浏览2
暂无评分
摘要
Combinatorial Optimization Problems In Geometric Settings arise in several areas of Network Design such as positioning of cell phone towers or other sensors to provide coverage to the area of interest. These problems can typically be formulated as some version of geometric set cover such as clustering, facility. In a non-geometric setting all these problems would typically be hard to solve. The underlying geometry can at times be exploited, however, to find efficient approximate solutions.
更多
查看译文
关键词
underlying geometry,combinatorial optimization problems,efficient approximate solution,geometric set,cell phone tower,network design,geometric settings,theory,approximation algorithms,computational geometry,algorithms
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要