.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
combinatorial optimization
computing science
complexity theory
traveling salesman
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
ShareSaveShareSavePredictive risk stratification model: a progressive cluster-randomised trial in chronic conditions management (PRISMATIC) research protocol.png)
Trials
OAAI
TrialsIF0
OAAIShareSaveAdvanced Diabetic Glomerulopathy: Quantitative Structural Characterization of Nonoccluded GlomeruliDiabetes
DiabetesIF0
PREAI
ShareSave
View more