Login / Signup

An O(n log n) Lower Bound for Decomposing a Set of Points into Chains.

Peter A. BloniarzS. S. Ravi
Published in: Inf. Process. Lett. (1989)
Keyphrases
  • lower bound
  • upper bound
  • worst case
  • optimal solution
  • convex hull
  • lower and upper bounds
  • data sets
  • branch and bound algorithm
  • neural network
  • branch and bound
  • minimum distance
  • average distance