Minimum color spanning circle of imprecise points

Ankush Acharyya,Ramesh K. Jallu,Vahideh Keikha,Maarten Löffler,Maria Saumell

Theoretical Computer Science（2022）

引用 0|浏览12

暂无评分

摘要

•The smallest minimum color-spanning circle (S-MCSC) problem can be solved in O(nklog⁡n) time.•The largest minimum color-spanning circle (L-MCSC) problem is NP-Hard.•A 13-factor (12, if no two distinct color disks intersect) approximation to the L-MCSC problem can be computed in O(nklog⁡n) time.

查看译文

关键词

Color spanning circle,Imprecise points,Algorithms,Computational complexity

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要