scientific article; zbMATH DE number 1947395
From MaRDI portal
zbMath1019.68807MaRDI QIDQ4411361
James B. Orlin, B. J. Lageweg, K. M. J. De Bontridder, Jan Karel Lenstra, Leen Stougie
Publication date: 8 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2461/24610223.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Deterministic versus randomized adaptive test cover, Randomized Adaptive Test Cover, Combinatorial search in two and more rounds, System of unbiased representatives for a collection of bicolorings, Fixed-parameter tractable algorithms for tracking shortest paths, Logic classification and feature selection for biomedical data, Induced-bisecting families of bicolorings for hypergraphs, An Improved Branch-and-Bound Method for Maximum Monomial Agreement, An adaptive heuristic algorithm for VLSI test vectors selection, Parameterizations of test cover with bounded test sizes
