The SONET edge‐partition problem

DOI10.1002/net.10054zbMath1026.90076OpenAlexW2139721783MaRDI QIDQ4797943

Olivier Goldschmidt, Asaf Levin, Eli V. Olinick, Dorit S. Hochbaum

Publication date: 10 March 2003

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.10054

zbMATH Keywords

combinatorial optimizationgraph partitioningapproximation algorithmssurvivable network designtelecommunications networksequipment placement in SONET rings

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (17)

Grooming in unidirectional rings: \(K_{4}-e\) designs ⋮ Planning personnel retraining: column generation heuristics ⋮ Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph ⋮ Traffic grooming on the path ⋮ Complexity, algorithmic, and computational aspects of a dial-a-ride type problem ⋮ On the complexity and algorithm of grooming regular traffic in WDM optical networks ⋮ Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network. ⋮ Grooming traffic to minimize load ⋮ Grooming for two-period optical networks ⋮ A better approximation algorithm for the budget prize collecting tree problem. ⋮ Approximation algorithms for grooming in optical network design ⋮ Minimizing SONET Add‐Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths ⋮ Approximating the traffic grooming problem ⋮ Approximation algorithms for the design of SDH/SONET networks ⋮ Scheduling Personnel Retraining: Column Generation Heuristics ⋮ Cutting plane algorithms for solving a stochastic edge-partition problem ⋮ Comparing metaheuristic algorithms for SONET network design problems

This page was built for publication: The SONET edge‐partition problem