Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings

DOI10.1137/S0895480101386723zbMath1101.68007MaRDI QIDQ4652599

Christine T. Cheng

Publication date: 28 February 2005

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

WDM networksSONET ringsbandwidth allocation problemdemand routing and slotting

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Network protocols (68M12)

Related Items (4)

On packing and coloring hyperedges in a cycle ⋮ Stability vs. optimality in selfish ring routing ⋮ Balancing Load via Small Coalitions in Selfish Ring Routing Games ⋮ Perfect circular arc coloring

This page was built for publication: Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings