Login / Signup
A tight analysis of Kierstead-Trotter algorithm for online unit interval coloring.
Tetsuya Araki
Koji M. Kobayashi
Published in:
CoRR (2016)
Keyphrases
</>
learning algorithm
similarity measure
neural network
preprocessing
k means
convex hull
optimal solution
lower bound
expectation maximization
shortest path