The Bandwidth Allocation Problem in the ATM network model is NP-complete

DOI10.1016/S0020-0190(98)00226-9zbMath1339.68107OpenAlexW1968063578MaRDI QIDQ293234

Sundararajan Vedantham, S. Sitharama Iyengar

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098002269?np=y

zbMATH Keywords

computational complexitygenetic algorithmsATMNP-complete

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• The Asynchronous Transfer Mode: a tutorial
• Unnamed Item

This page was built for publication: The Bandwidth Allocation Problem in the ATM network model is NP-complete