NP-Completeness of Spreading Colored Points
文献类型：会议论文
| 作者 | Ovidiu Daescu; Wenqi Ju; Jun Luo |
| 出版日期 | 2010 |
| 会议名称 | 4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010 |
| 英文摘要 | There are n points in the plane and each point is painted by one of m colors where m &len. We want to select m different color points such that (1) the total edge length of resulting minimal spanning tree is as small as possible; or (2) the total edge length of resulting minimal spanning tree is as large as possible; or (3) the perimeter of the convex hull of m different color points is as small as possible. We prove NP-completeness for those three problems and give approximations algorithms for the third problem |
| 收录类别 | EI |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/3132]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 作者单位 | 2010 |
| 推荐引用方式 GB/T 7714 | Ovidiu Daescu,Wenqi Ju,Jun Luo. NP-Completeness of Spreading Colored Points[C]. 见:4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。