GMPLS label space minimization through hypergraph layouts

DOI10.1016/j.tcs.2012.01.033zbMath1243.68024MaRDI QIDQ442249

Stéphane Pérennes, Jean-Claude Bermond, Ignasi Sau, David Coudert, Joanna Moulierac, Fernando Solano Donado

Publication date: 10 August 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.033

zbMATH Keywords

dynamic programming; optical networks; approximation algorithms; GMPLS; hypergraph layout; label stacking

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

05C65: Hypergraphs

68R10: Graph theory (including graph drawing) in computer science

90C39: Dynamic programming

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms