GMPLS label space minimization through hypergraph layouts

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

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

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 programmingoptical networksapproximation algorithmsGMPLShypergraph layoutlabel stacking

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

GMPLS label space minimization through hypergraph layouts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• GMPLS label space minimization through hypergraph layouts
• The Steiner problem with edge lengths 1 and 2
• Optimal layouts on a chain ATM network
• Directed virtual path layouts in ATM networks
• A threshold of ln n for approximating set cover
• Designing Hypergraph Layouts to GMPLS Routing Strategies
• Biconnectivity approximations and graph carvings
• Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: GMPLS label space minimization through hypergraph layouts