Login / Signup

Lower Bounds for the Virtual Path Layout Problem in ATM Networks.

Luca BecchettiCarlo Gaibisso
Published in: SOFSEM (1997)
Keyphrases
  • atm networks
  • lower bound
  • upper bound
  • admission control
  • shortest path
  • objective function
  • np hard
  • linear programming
  • quality of service
  • resource allocation