A New Heuristic for the Minimum Routing Cost Spanning Tree Problem.
Alok SinghPublished in: ICIT (2008)
Keyphrases
- spanning tree
- minimum cost
- minimum spanning tree
- optimal solution
- optimal cost
- search effort
- heuristic function
- routing decisions
- total cost
- np hard
- min sum
- simulated annealing
- approximation algorithms
- packet transmission
- interval data
- expected cost
- routing algorithm
- solution quality
- search algorithm
- exact algorithms
- mixed integer programming
- wireless ad hoc networks
- fixed cost
- optimal planning
- combinatorial optimization
- routing protocol