A Cost-Efficient Scheduling Algorithm for Traffic Grooming

DOI10.1007/978-3-642-38756-2_25zbMath1303.90049OpenAlexW51495469MaRDI QIDQ5405936

Xianrong Liu, Minxian Xu, Wenhong Tian, Qin Xiong

Publication date: 3 April 2014

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38756-2_25

zbMATH Keywords

traffic groomingfiber lengths minimization problemlongest link interval first (LLF)minimizing total fiber length

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

This page was built for publication: A Cost-Efficient Scheduling Algorithm for Traffic Grooming