Test sets for vertex cover problems

MaRDI QIDQ2741341zbMATH OpenFDO

Authors M. Hayer, Winfried. Hochstättler

Publication date 23 September 2001

Full work available at URL http://www.elsevier.nl/cas/tree/store/disc/free/endm/store/contents.htt?jrnl=disc&sctn=endm&mode=sub&vol=3

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Programming involving graphs or networks (90C35)

Recommendations

• Sets defining minimal vertex covers
• Approximation algorithms for the test cover problem
• scientific article; zbMATH DE number 1947395
• Experimental and Efficient Algorithms
• Parameterized study of the test cover problem

Cites work

• A Geometric Buchberger Algorithm for Integer Programming
• Binomial ideals
• Gröbner bases of lattices, corner polyhedra, and integer programming
• scientific article; zbMATH DE number 177867 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Variation of cost functions in integer programming

Cited in

(3)

• Test sets for integer programs
• scientific article; zbMATH DE number 4204116 (Why is no real title available?)
• A Tighter Analysis of Set Cover Greedy Algorithm for Test Set

This page was built for publication: Test sets for vertex cover problems

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