The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings.
Bastien CazauxEric RivalsPublished in: Discret. Appl. Math. (2016)
Keyphrases
- greedy algorithms
- greedy algorithm
- knapsack problem
- branch and bound
- search algorithm
- traveling salesman problem
- branch and bound algorithm
- power consumption
- genetic algorithm
- artificial intelligence
- combinatorial optimization problems
- worst case
- power distribution
- neural network
- objective function
- decision making
- machine learning
- data mining