Login / Signup
A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone.
Glenn K. Manacher
Terrance A. Mankus
Published in:
Networks (2002)
Keyphrases
</>
learning algorithm
worst case
search space
np hard
objective function
segmentation algorithm
matching algorithm
noisy data
circular arcs
optimal solution
lower bound
segmentation method
graph theory
greedy heuristic