On the complexity of quality of service routing

DOI10.1016/S0020-0190(98)00206-3zbMath1338.68121MaRDI QIDQ294629

Zheng Wang

Publication date: 16 June 2016

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

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

zbMATH Keywords

shortest pathroutingcomputational complexity: NP-completenessmultiple constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Multi-postpath-based lookahead multiconstraint QoS routing ⋮ Polynomial time approximation schemes for the constrained minimum spanning tree problem

Cites Work

• Algorithms for finding paths with multiple constraints
• Unnamed Item

This page was built for publication: On the complexity of quality of service routing