On the computational complexity of the Probabilistic Traveling Salesman Problem with Deadlines.
Dennis WeylandPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- computational complexity
- np complete
- response time
- special case
- computational load
- low complexity
- high computational complexity
- computational cost
- np hard
- linear computational complexity
- storage requirements
- memory requirements
- motion estimation
- description logics
- multiresolution
- bit rate
- rate distortion
- computational efficiency
- cooperative
- multi agent
- image processing
- e learning
- artificial intelligence
- learning algorithm