Hardness and approximation of minimum maximal matchings.
Marc DemangeTínaz EkimCerasela TanasescuPublished in: Int. J. Comput. Math. (2014)
Keyphrases
- approximation algorithms
- np hard
- constant factor
- efficient computation
- phase transition
- databases
- computational complexity
- worst case
- minimum cost
- closed form
- error bounds
- integer points
- approximation ratio
- information theoretic
- np complete
- machine learning
- graphical models
- queueing networks
- minimum distance
- approximation methods
- real world
- agnostic learning
- square error
- neural network