Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem.
Manuel DubinskyKun-Mao ChaoCésar MassriGabriel TaubinPublished in: CoRR (2024)
Keyphrases
- minimum spanning tree
- lower bound
- spanning tree
- upper bound
- graph theory
- branch and bound
- traveling salesman problem
- np hard
- minimum weight
- weighted graph
- shortest path
- objective function
- worst case
- ant colony optimization
- lower and upper bounds
- linear programming relaxation
- steiner tree
- optimal solution
- bayesian networks
- similarity measure