An efficient approximate algorithm for delay-cost-constrained QoS routing.

Gang Feng Kia Makki Niki Pissinou Christos Douligeris

Published in: ICCCN (2001)

Keyphrases

np hard
k means
learning algorithm
objective function
particle swarm optimization
social networks
optimal solution
path planning
communication networks
resource management
qos routing