A $O(\log m)$, deterministic, polynomial-time computable approximation of Lewis Carroll's scoring rule
Jason A. CoveyChristopher HomanPublished in: CoRR (2008)
Keyphrases
- turing machine
- approximation algorithms
- approximation ratio
- approximation guarantees
- randomized algorithms
- error bounds
- polynomial time approximation
- finite sets
- randomized algorithm
- worst case
- special case
- np hard
- closed form
- relaxation algorithm
- constant factor
- satisfy the triangle inequality
- greedy algorithm
- production rules
- integrality gap
- computational complexity
- low degree
- queueing networks
- neural network
- rule sets
- classification rules
- decision trees