On the Approximation Ratio of Algorithms for Sorting by Transpositions without Using Cycle Graphs.
Gustavo Rodrigues GalvãoZanoni DiasPublished in: BSB (2012)
Keyphrases
- learning algorithm
- computationally efficient
- theoretical analysis
- times faster
- significant improvement
- machine learning algorithms
- computational complexity
- data mining
- optimization problems
- orders of magnitude
- combinatorial optimization
- approximation algorithms
- graph theory
- graph data
- randomized algorithms
- representational power