Complexity and algorithms for constant diameter augmentation problems.
Eun Jung KimMartin MilanicJérôme MonnotChristophe PicouleauPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- worst case
- optimization problems
- computational cost
- practical problems
- orders of magnitude
- run times
- related problems
- benchmark problems
- computationally hard
- approximate solutions
- theoretical analysis
- problems in computer vision
- hard problems
- computational complexity
- computational issues
- partial solutions
- greedy algorithms
- lower complexity
- test problems
- inference problems
- search methods
- combinatorial optimization
- complexity bounds
- reduced complexity
- np hard problems
- learning algorithm
- high computational complexity
- space complexity
- np hardness
- exact and approximate
- graph theory
- memory requirements
- machine learning algorithms
- multi class
- multi objective
- data structure
- machine learning
- polynomial time complexity