NP-hardness and fixed-parameter tractability of the minimum spanner problem.
Yusuke KobayashiPublished in: Theor. Comput. Sci. (2018)
Keyphrases
- np hardness
- np hard
- fixed parameter tractability
- minimum cost
- approximation algorithms
- fixed parameter tractable
- lower bound
- single peaked
- np complete
- mixed integer
- integer programming
- scheduling problem
- decision problems
- graph theory
- linear program
- linear programming
- optimal solution
- worst case
- special case
- search algorithm