Faster algorithms for cograph edge modification problems.
Dekel TsurPublished in: Inf. Process. Lett. (2020)
Keyphrases
- optimization problems
- problems in computer vision
- learning algorithm
- computational problems
- memory efficient
- run times
- np hard problems
- approximate solutions
- related problems
- test problems
- combinatorial optimization
- times faster
- orders of magnitude
- practical problems
- benchmark datasets
- computationally hard
- computationally demanding
- specific problems
- machine learning
- multi class
- hard problems
- greedy algorithms
- exact and approximate
- worst case
- theoretical guarantees
- markov random field
- theoretical analysis
- search methods