A quadratic lower bound for colourful simplicial depth.
Tamon StephenHugh ThomasPublished in: J. Comb. Optim. (2008)
Keyphrases
- lower bound
- objective function
- upper bound
- branch and bound
- branch and bound algorithm
- np hard
- lower and upper bounds
- depth information
- worst case
- depth map
- optimal solution
- computational complexity
- pairwise
- quadratic function
- information systems
- high quality
- case study
- machine learning
- semidefinite
- randomized algorithm
- real time