Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests

DOI10.1007/978-3-642-14162-1_28zbMath1288.68014OpenAlexW2117779672MaRDI QIDQ3587450

Ignasi Sau, Shmuel Zaks, Mordechai Shalom, George B. Mertzios

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/9282/1/9282.pdf

zbMATH Keywords

optical networksapproximation algorithmshardness of approximationregeneratorsoverprovisioning

Mathematics Subject Classification ID

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

Related Items (5)

The Generalized Regenerator Location Problem ⋮ Online regenerator placement ⋮ Optimizing regenerator cost in traffic grooming ⋮ On the complexity of the regenerator cost problem in general networks with traffic grooming ⋮ On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks

This page was built for publication: Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests