On the Approximability of Some Maximum Spanning Tree Problems.
Giulia GalbiatiAngelo MorzentiFrancesco MaffioliPublished in: Theor. Comput. Sci. (1997)
Keyphrases
- np complete
- mathematical programming
- constraint satisfaction problems
- multi objective
- difficult problems
- approximation algorithms
- benchmark problems
- application domains
- np hard
- databases
- artificial neural networks
- pattern recognition
- computer vision
- search engine
- genetic algorithm
- information retrieval
- neural network