A study on the efficient approximation algorithms for NP-complete problems

MaRDI QIDQ2708197zbMATH OpenFDO

Authors Hirotoshi Honma

Publication date 21 August 2001

Published in Research Reports (Search for Journal in Brave)

zbMATH Keywords

travelling salesman problem

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Approximation Algorithms: Good Solutions to Hard Problems
• scientific article; zbMATH DE number 1206043
• scientific article; zbMATH DE number 3902037
• scientific article; zbMATH DE number 1778409
• scientific article; zbMATH DE number 3999286

Cited in

(3)

• scientific article; zbMATH DE number 1778409 (Why is no real title available?)
• Approximation Algorithms: Good Solutions to Hard Problems
• An introduction to NP-completeness in fuzzy context

This page was built for publication: A study on the efficient approximation algorithms for NP-complete problems

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