Unique (optimal) solutions: Complexity results for identifying and locating-dominating codes.
Olivier HudryAntoine LobsteinPublished in: Theor. Comput. Sci. (2019)
Keyphrases
- memory requirements
- optimal solution
- computational complexity
- np hard
- database
- artificial intelligence
- branch and bound
- search space
- multiobjective optimization
- branch and bound algorithm
- low complexity
- dynamic programming
- special case
- search algorithm
- data structure
- objective function
- learning algorithm
- real world
- neural network
- databases