scientific article; zbMATH DE number 3878680

MaRDI QIDQ3343775zbMATH OpenFDO

Authors Ravi Kannan, Bernhard Korte

Publication date 1984

zbMATH Keywords

approximation algorithmsbin packingcombinatorial optimizationgraph colouringgreedy heuristicsindependent systemknapsackNP-completenesspolynomial timesubmodular functiontraveling salesman

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3873084
• scientific article; zbMATH DE number 3999286
• scientific article; zbMATH DE number 3850828
• scientific article; zbMATH DE number 1330033
• Approximate local search in combinatorial optimization

Cited in

(8)

• The principle of optimality in the design of efficient algorithms
• Combinatorial approximation algorithms: a comparative review
• Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
• scientific article; zbMATH DE number 3850828 (Why is no real title available?)
• scientific article; zbMATH DE number 3873084 (Why is no real title available?)
• scientific article; zbMATH DE number 3873085 (Why is no real title available?)
• scientific article; zbMATH DE number 3999286 (Why is no real title available?)
• Approximation algorithms. An introduction.

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 Q3343775)