Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests

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

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

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 networks; approximation algorithms; hardness of approximation; regenerators; overprovisioning

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

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

68W25: Approximation algorithms