Approximable 1-turn routing problems in all-optical mesh networks

MaRDI QIDQ2867367zbMATH OpenFDO

Authors Jérôme Palaysi, Olivier Cogis, Guillaume Bagan

Publication date 11 December 2013

Published in Algorithmic Operations Research (Search for Journal in Brave)

Full work available at URL http://journals.hil.unb.ca/index.php/AOR/article/view/4177

zbMATH Keywords

approximation algorithmsmeshall-optical networks1-turn-routingminimum load routingminimum path colouring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 1984545
• All-to-all optical routing in chordal rings of degree 4
• On the Complexity of the Traffic Grooming Problem in Optical Networks
• scientific article; zbMATH DE number 1500650
• scientific article; zbMATH DE number 1421019

Cited in

(2)

• scientific article; zbMATH DE number 1984545 (Why is no real title available?)
• An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks

This page was built for publication: Approximable 1-turn routing problems in all-optical mesh networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867367)