Approximation Algorithms for Multiconstrained Quality-of-Service Routing

  • Authors:
  • Meongchul Song;Sartaj Sahni

  • Affiliations:
  • IEEE;IEEE

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 2006

Quantified Score

Hi-index 14.99

Visualization

Abstract

We propose six new heuristics to find a source-to-destination path that satisfies two or more additive constraints on edge weights. Five of these heuristics become \epsilon{\hbox{-}}{\rm approximation} algorithms when their parameters are appropriately set. The performance of our new heuristics is compared experimentally with that of two recently proposed heuristics for the same problem.