The Tandem Duplication Distance Is NP-Hard.
Manuel LafondBinhai ZhuPeng ZouPublished in: STACS (2020)
Keyphrases
- np hard
- distance measure
- scheduling problem
- approximation algorithms
- optimal solution
- special case
- linear programming
- distance function
- np hardness
- integer programming
- np complete
- closely related
- inversely proportional
- hamming distance
- decision problems
- distance metric
- evolutionary algorithm
- lower bound
- genetic algorithm
- data mining
- neural network
- constraint satisfaction problems
- branch and bound algorithm
- knapsack problem
- learning algorithm
- minimum cost
- intra class
- approximation ratio
- average distance
- distance measurement
- real time