scientific article; zbMATH DE number 845765

MaRDI QIDQ4864343zbMATH OpenFDO

Authors Marc Demange, Vangelis Th. Paschos

Publication date 19 August 1996

zbMATH Keywords

approximabilitymaximum independent set problemsminimum vertex covering

Mathematics Subject Classification ID

Convex programming (90C25) Combinatorial optimization (90C27)

Recommendations

• The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems
• On approximation problems related to the independent set and vertex cover problems
• Approximation of the quadratic set covering problem
• On the complexity of approximating the independent set problem
• The complexity of approximating a nonlinear program

Cited in

(2)

• The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems
• Approximation of the quadratic set covering problem

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