Login / Signup
Fully Polynomial-Time Approximation Scheme for a Problem of Finding a Subsequence.
Alexander Kelmanov
Sergey A. Khamidullin
Semyon Romanchenko
Published in:
DOOR (Supplement) (2016)
Keyphrases
</>
polynomial time approximation
error bounds
approximation algorithms
np hard
vertex cover
bin packing
special case
pattern matching
theoretical analysis
greedy algorithm
learning algorithm
search algorithm
active learning
approximation guarantees
identical machines