On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems.
Christian KnauerHans Raj TiwaryDaniel WernerPublished in: STACS (2011)
Keyphrases
- related problems
- computational complexity
- broadly applicable
- special case
- np complete
- range searching
- stable marriage
- high computational complexity
- storage requirements
- computationally efficient
- np hard
- motion estimation
- computational cost
- rate distortion
- low complexity
- bayesian networks
- artificial intelligence
- learning algorithm
- structured databases
- databases
- real time
- biomedical ontologies
- database