scientific article; zbMATH DE number 1789921

MaRDI QIDQ4549232zbMATH OpenFDO

Authors Uriel Feige

Publication date 27 August 2002

zbMATH Keywords

approximation algorithmscombinatorial optimization problemNP-hardnessthresholds

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• On Approximate Solutions for Combinatorial Optimization Problems
• Approximability of hard combinatorial optimization problems: an introduction
• scientific article; zbMATH DE number 1247158
• Approximation algorithms for stochastic combinatorial optimization problems
• scientific article; zbMATH DE number 3873084
• Differential approximation algorithms for some combinatorial optimization problems
• scientific article; zbMATH DE number 3873085
• Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
• scientific article; zbMATH DE number 2077129

Cited in

(4)

• On approximating NP-hard optimization problems
• A natural family of optimization problems with arbitrarily small approximation thresholds
• On Approximate Solutions for Combinatorial Optimization Problems
• Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4549232)