Branch-and-Bound Algorithms for the Test Cover Problem-Reference-Cited by-同舟云学术

Branch-and-Bound Algorithms for the Test Cover Problem

Published:2002 Issue: Volume: Page:223-233
ISSN:0302-9743
Container-title:Algorithms — ESA 2002
language:
Short-container-title:

Author:

De Bontridder Koen M. J.,Lageweg B. J.,Lenstra Jan K.,Orlin James B.,Stougie Leen

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45749-6_23

Reference12 articles.

1. H.Y. Chang, E. Manning, G. Metze, Fault diagnosis of digital systems, Wiley, New York, 1970.

2. K.M. J. DeBontridder, Methods for solving the test cover problem, Master’s Thesis, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, February 1997.

3. K.M. J. De Bontridder, B.V. Halldórsson, M. M. Halldórsson, C.A. J. Hurkens, J.K. Lenstra, R. Ravi, L. Stougie, Approximation algorithms for the test cover problem, Submitted for publication, 2002.

4. M.R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.

5. A.W. J. Kolen, J.K. Lenstra, Combinatorics in operations research, in R. Graham, M. Grötschel, L. Lovász (eds.), Handbook of Combinatorics, Elsevier, Amsterdam, 1995, 1875–1910.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Lightweight Coordinated Sampling for Dynamic Flows under Budget Constraints;2024 33rd International Conference on Computer Communications and Networks (ICCCN);2024-07-29

2. Fixed-Parameter Tractable Algorithms for Tracking Set Problems;Algorithms and Discrete Applied Mathematics;2018

3. Parameterizations of Test Cover with Bounded Test Sizes;Algorithmica;2014-10-17

4. An Improved Branch-and-Bound Method for Maximum Monomial Agreement;INFORMS Journal on Computing;2012-05

5. A Novel EDA Tool for VLSI Test Vectors Management;Journal of Electronic Testing;2007-09-21