scientific article; zbMATH DE number 3902037

MaRDI QIDQ3680277zbMATH OpenFDO

Authors Giorgio Ausiello

Publication date 1984

zbMATH Keywords

approximate solutionNP-complete decision problemsoptimization problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3999286
• Approximability of hard combinatorial optimization problems: an introduction
• Optimization, approximation, and complexity classes
• Approximate solution of NP optimization problems
• scientific article; zbMATH DE number 4155842

Cited in

(26)

• On approximating NP-hard optimization problems
• Assessment of approximate algorithms: The error measure's crucial role
• Some aspects of studying an optimization or decision problem in different computational models
• Solvable cases of a new combinatorial problem of optimization
• Computation and complexity
• A new algorithm design technique for hard problems
• A method of estimating computational complexity based on input conditions for N-vehicle problem
• Open problems around exact algorithms
• A study on the efficient approximation algorithms for NP-complete problems
• Approximation algorithms for NP-hard problems.
• Overview of some solved NP-complete problems in graph theory
• On estimation algorithms vs approximation algorithms
• scientific article; zbMATH DE number 4155842 (Why is no real title available?)
• Approximative Algorithmen und Nichtapproximierbarkeit
• The effectiveness of finite improvement algorithms for finding global optima
• scientific article; zbMATH DE number 1206043 (Why is no real title available?)
• scientific article; zbMATH DE number 1335885 (Why is no real title available?)
• scientific article; zbMATH DE number 1342107 (Why is no real title available?)
• Approximation Algorithms: Good Solutions to Hard Problems
• scientific article; zbMATH DE number 3999286 (Why is no real title available?)
• scientific article; zbMATH DE number 1407504 (Why is no real title available?)
• An introduction to NP-completeness in fuzzy context
• An approximation approach to Cook hypothesis
• Most relevant explanation: Computational complexity and approximation methods
• In some curved spaces, one can solve NP-hard problems in polynomial time
• -optimization schemes and L-bit precision: alternative perspectives for solving combinatorial optimization 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 Q3680277)