The SONET edge‐partition problem

DOI10.1002/net.10054zbMath1026.90076MaRDI 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 optimization; graph partitioning; approximation algorithms; survivable network design; telecommunications networks; equipment placement in SONET rings

Mathematics Subject Classification ID

90C27: Combinatorial optimization

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

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