Using adaptive memory in GRASP to find minimum conflict-free spanning trees.
Bruno José da Silva BarrosRian Gabriel S. PinheiroUéverton S. SouzaLuiz Satoru OchiPublished in: Soft Comput. (2023)
Keyphrases
- spanning tree
- conflict free
- edge disjoint
- minimum cost
- minimum spanning tree
- minimum spanning trees
- functional dependencies
- np hard
- minimum total cost
- approximation algorithms
- database
- total length
- data model
- probabilistic model
- lower bound
- argumentation frameworks
- multi agent
- multivalued dependencies
- decision making