Deterministic versus randomized adaptive test cover (Q329717): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2016.09.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2528667811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially Polynomial Kernels for Set Cover and Test Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the test cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new randomized algorithm for group testing with unknown number of defective items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group Testing With Probabilistic Tests: Theory, Design and Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizations of test cover with bounded test sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Study of the Test Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tighter Analysis of Set Cover Greedy Algorithm for Test Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3507769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parameterized Perspective on Packing Paths of Length Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Non-)existence of polynomial kernels for the test cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group Testing With Random Pools: Optimal Two-Stage Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-approximability results for optimization problems on bounded degree instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounds in combinatorial search / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:39, 12 July 2024

scientific article
Language Label Description Also known as
English
Deterministic versus randomized adaptive test cover
scientific article

    Statements

    Deterministic versus randomized adaptive test cover (English)
    0 references
    0 references
    21 October 2016
    0 references
    combinatorial search
    0 references
    randomization
    0 references
    game theory
    0 references
    LP duality
    0 references
    set cover
    0 references
    fractional graph theory
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references