Approximation and Parameterized Algorithms for Balanced Connected Partition Problems.
Phablo F. S. MouraMatheus Jun OtaYoshiko WakabayashiPublished in: CALDAM (2022)
Keyphrases
- optimization problems
- orders of magnitude
- learning algorithm
- computational problems
- problems in computer vision
- benchmark problems
- error bounds
- approximation schemes
- run times
- partial solutions
- difficult problems
- practical problems
- related problems
- data structure
- approximate solutions
- significant improvement
- combinatorial optimization
- worst case
- times faster
- computationally efficient
- data mining tasks
- computational cost
- multi objective
- approximation algorithms
- theoretical analysis
- exact algorithms
- specific problems
- k means
- greedy algorithms
- np hard problems
- computational complexity