An Improved Greedy Curvature Bound in Finite-Horizon String Optimization with an Application to a Sensor Coverage Problem
2023 62ND IEEE CONFERENCE ON DECISION AND CONTROL, CDC(2023)
摘要
We study the optimization problem of choosing strings of finite length to maximize string submodular functions on string matroids, which is a broader class of problems than maximizing set submodular functions on set matroids. We provide a lower bound for the performance of the greedy algorithm in our problem, and then prove that our bound is superior to the greedy curvature bound of Conforti and Cornu ' ejols. Our bound has lower computational complexity than most previously proposed curvature bounds. Finally, we demonstrate the strength of our result on a sensor coverage problem.
更多查看译文
关键词
improved greedy curvature bound,sensor coverage problem,optimization,finite-horizon
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要