Designing FPT Algorithms for Cut Problems Using Randomized Contractions.
Rajesh ChitnisMarek CyganMohammadTaghi HajiaghayiMarcin PilipczukMichal PilipczukPublished in: SIAM J. Comput. (2016)
Keyphrases
- association rules
- data mining
- optimization problems
- benchmark problems
- test problems
- hard problems
- difficult problems
- practical problems
- problems in computer vision
- specific problems
- computational problems
- orders of magnitude
- computational cost
- run times
- greedy algorithms
- planar graphs
- partial solutions
- randomized algorithms
- learning algorithm
- machine learning algorithms
- theoretical analysis
- computationally efficient
- np complete
- computational complexity
- graph theory
- approximate solutions
- greedy algorithm
- search methods
- computationally hard
- special case