Branch-and-bound algorithms for the test cover problem

DOI10.1007/3-540-45749-6_23MaRDI QIDQ4411361zbMATH OpenFDO

Authors Koen Margerite Jozef De Bontridder, B. J. Lageweg, James B. Orlin, Jan Karel Lenstra, L. Stougie

Publication date 8 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610223.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05)

Recommendations

• Experimental and Efficient Algorithms
• A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques
• Approximation algorithms for the test cover problem
• Parameterized study of the test cover problem
• Parameterizations of test cover with bounded test sizes

Cited in

(17)

• An adaptive heuristic algorithm for VLSI test vectors selection
• Approximation algorithms for the test cover problem
• Induced-bisecting families of bicolorings for hypergraphs
• The generalized test collection problem
• System of unbiased representatives for a collection of bicolorings
• Fixed-parameter tractable algorithms for tracking shortest paths
• Combinatorial search in two and more rounds
• Tight approximability results for test set problems in bioinformatics
• Parameterizations of test cover with bounded test sizes
• Test sets for vertex cover problems
• An improved branch-and-bound method for maximum monomial agreement
• Parameterized study of the test cover problem
• Randomized adaptive test cover
• Deterministic versus randomized adaptive test cover
• A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques
• Experimental and Efficient Algorithms
• Logic classification and feature selection for biomedical data

This page was built for publication: Branch-and-bound algorithms for the test cover problem

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