approximation and hardness results for label cut and related problems
文献类型：会议论文
| 作者 | Zhang Peng ; Cai Jin-Yi ; Tang Linqing ; Zhao Wenbo |
| 出版日期 | 2009 |
| 会议名称 | 6th Annual Conference on Theory and Applications of Models of Computation, TAMC 2009 |
| 会议日期 | 43969 |
| 会议地点 | Changsha, China |
| 关键词 | Approximation algorithms Combinatorial optimization Computational complexity Graph theory Hardness |
| 页码 | 460-469 |
| 会议主办者 | South Central University |
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| 会议录出版地 | Germany |
| 语种 | 英语 |
| ISSN号 | 3029743 |
| ISBN号 | 9783642020162 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/8462]  |
| 专题 | 软件研究所_计算机科学国家重点实验室 _会议论文 |
| 推荐引用方式 GB/T 7714 | Zhang Peng,Cai Jin-Yi,Tang Linqing,et al. approximation and hardness results for label cut and related problems[C]. 见:6th Annual Conference on Theory and Applications of Models of Computation, TAMC 2009. Changsha, China. 43969. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。