中国科学院理论物理研究所机构知识库
Advanced  
ITP OpenIR  > 理论物理所2014年知识产出  > 期刊论文
题名: Statistical physics of hard combinatorial optimization: Vertex cover problem
作者: Zhao, JH ;  Zhou, HJ
刊名: CHINESE PHYSICS B
出版日期: 2014
卷号: 23, 期号:7, 页码:78901
关键词: RANDOM GRAPHS ;  INDEPENDENCE NUMBER ;  CAVITY METHOD ;  MECHANICS ;  NETWORKS ;  DYNAMICS ;  MODELS ;  SET
学科分类: Physics
DOI: 10.1088/1674-1056/23/7/078901
通讯作者: Zhou, HJ (reprint author), Chinese Acad Sci, Inst Theoret Phys, State Key Lab Theoret Phys, Beijing 100190, Peoples R China.
部门归属: [Zhao Jin-Hua ;  Zhou Hai-Jun] Chinese Acad Sci, Inst Theoret Phys, State Key Lab Theoret Phys, Beijing 100190, Peoples R China
英文摘要: Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years, the replica-symmetry-breaking mean field theory of spin glasses and the associated message-passing algorithms have greatly deepened our understanding of typical-case computation complexity. In this paper, we use the vertex cover problem, a basic nondeterministic-polynomial (NP)-complete combinatorial optimization problem of wide application, as an example to introduce the statistical physical methods and algorithms. We do not go into the technical details but emphasize mainly the intuitive physical meanings of the message-passing equations. A nonfamiliar reader shall be able to understand to a large extent the physics behind the mean field approaches and to adjust the mean field methods in solving other optimization problems.
资助者: National Basic Research Program of China [2013CB932804]; Chinese Academy of Sciences [KJCX2-EW-J02]; National Natural Science Foundation of China [11121403, 11225526]
收录类别: SCI
原文出处: 查看原文
语种: 英语
WOS记录号: WOS:000338925300110
Citation statistics: 
内容类型: 期刊论文
URI标识: http://ir.itp.ac.cn/handle/311006/15720
Appears in Collections:理论物理所2014年知识产出 _期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Zhao, JH,Zhou, HJ. Statistical physics of hard combinatorial optimization: Vertex cover problem[J]. CHINESE PHYSICS B,2014,23(7):78901.
Service
 Recommend this item
 Sava as my favorate item
 Show this item's statistics
 Export Endnote File
Google Scholar
 Similar articles in Google Scholar
 [Zhao, JH]'s Articles
 [Zhou, HJ]'s Articles
CSDL cross search
 Similar articles in CSDL Cross Search
 [Zhao, JH]‘s Articles
 [Zhou, HJ]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
  Add to CiteULike  Add to Connotea  Add to Del.icio.us  Add to Digg  Add to Reddit 
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2017  中国科学院理论物理研究所 - Feedback
Powered by CSpace