scientific article; zbMATH DE number 563689

MaRDI QIDQ4291269zbMATH OpenFDO

Authors Marc Demange, Pascal Grisoni, Vangelis Th. Paschos

Publication date 16 June 1994

zbMATH Keywords

polynomial time algorithm

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Numerical methods in optimal control (49M99)

Recommendations

• Differential approximation algorithms for some combinatorial optimization problems
• scientific article; zbMATH DE number 784428
• Approximation results for the minimum graph coloring problem
• On the hardness of approximating minimization problems

Cited in

(5)

• Differential approximation algorithms for some combinatorial optimization problems
• On an approximation measure founded on the links between optimization and polynomial approximation theory
• scientific article; zbMATH DE number 5841814 (Why is no real title available?)
• scientific article; zbMATH DE number 884977 (Why is no real title available?)
• A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set

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