Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes.
Annalisa De BonisUgo VaccaroPublished in: IEEE Trans. Inf. Theory (2006)
Keyphrases
- worst case
- optimization problems
- randomized algorithms
- related problems
- benchmark problems
- problems in computer vision
- group testing
- difficult problems
- theoretical guarantees
- significant improvement
- data structure
- np complete
- error bounds
- computational complexity
- linear programming
- approximate solutions
- error correcting codes
- practical problems
- average case
- run times
- computationally efficient
- combinatorial optimization
- theoretical analysis
- genetic algorithm
- computational cost
- np hard
- lower bound
- optimal solution
- objective function
- decision trees
- learning algorithm