Wavelength Conversion in Optical Networks

DOI10.1006/jagm.2000.1137zbMath0969.68113OpenAlexW1991300627MaRDI QIDQ2709790

Amit Kumar, Jon M. Kleinberg

Publication date: 7 October 2001

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/7331

zbMATH Keywords

optical routingundirected feedback vertex set problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (16)

Cutting-plane-based algorithms for two branch vertices related spanning tree problems ⋮ A feedback vertex set of 2-degenerate graphs ⋮ Feedback vertex sets in mesh-based networks ⋮ New upper bounds on feedback vertex numbers in butterflies ⋮ Optimization in telecommunication networks ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ Maximum weighted induced forests and trees: new formulations and a computational comparative review ⋮ New bounds on the decycling number of generalized de Bruijn digraphs ⋮ Local search is a PTAS for feedback vertex set in minor-free graphs ⋮ Feedback vertex set on AT-free graphs ⋮ On the minimum feedback vertex set problem: Exact and enumeration algorithms ⋮ Tight LP‐based lower bounds for wavelength conversion in optical networks ⋮ Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem ⋮ Routing to reduce the cost of wavelength conversion ⋮ On column generation formulations for the RWA problem ⋮ Minimum feedback vertex set and acyclic coloring.

This page was built for publication: Wavelength Conversion in Optical Networks