.png){kind=icon}
返回
Polynomial approximation algorithms with performance guarantees: An introduction-by-example
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2004.03.021.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a short overview on polynomial approximation of NP-hard problems. We present the main approximability classes together with examples of problems belonging to them. We also describe the general concept of approximability preserving reductions together with a discussion about their capacities and their limits. Finally, we present a quick description of what it is commonly called inapproximability results. Such results provide limits on the approximability of the problems tackled. (c) 2004 Elsevier B.V. All rights reserved.
Keyword:
combinatorial optimization
computing science
complexity theory
traveling salesman
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Predictive risk stratification model: a progressive cluster-randomised trial in chronic conditions management (PRISMATIC) research protocol.png)
Trials
OAAI
TrialsIF0
OAAI分享收藏Advanced Diabetic Glomerulopathy: Quantitative Structural Characterization of Nonoccluded GlomeruliDiabetes
DiabetesIF0
PREAI
分享收藏
查看更多内容