Improved Approximation Algorithms for the Average-Case Tree Searching Problem.
Ferdinando CicaleseTobias JacobsEduardo Sany LaberMarco MolinaroPublished in: Algorithmica (2014)
Keyphrases
- approximation algorithms
- average case
- worst case
- np hard
- worst case analysis
- upper bound
- vertex cover
- greedy algorithm
- lower bound
- minimum cost
- np hardness
- special case
- primal dual
- polynomial time approximation
- randomized algorithms
- uniform distribution
- set cover
- constant factor
- constant factor approximation
- approximation ratio
- sample size
- competitive ratio
- vc dimension
- integer programming
- machine learning algorithms