SIAM Journal on Discrete Mathematics
Ring routing and wavelength translation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Traffic partition in WDM/SONET rings to minimize SONET ADMs
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Better bounds for minimizing SONET ADMs
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Grooming of arbitrary traffic in SONET/WDM BLSRs
IEEE Journal on Selected Areas in Communications
Lightpath arrangement in survivable rings to minimize the switching cost
IEEE Journal on Selected Areas in Communications
The chord version for SONET ADMs minimization
Theoretical Computer Science
On minimizing the number of ADMs---Tight bounds for an algorithm without preprocessing
Journal of Parallel and Distributed Computing
Theoretical Computer Science
Selfishness, collusion and power of local search for the ADMs minimization problem
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximating the traffic grooming problem in tree and star networks
Journal of Parallel and Distributed Computing
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Better bounds for minimizing SONET ADMs
Journal of Computer and System Sciences
On minimizing the number of ADMs in a general topology optical network
Discrete Applied Mathematics
Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
On the complexity of the traffic grooming problem in optical networks
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Selfishness, collusion and power of local search for the ADMs minimization problem
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Approximating the traffic grooming problem in tree and star networks
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
SONET ADMs minimization with divisible paths
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
On minimizing the number of ADMs – tight bounds for an algorithm without preprocessing
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Approximating the traffic grooming problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On minimizing the number of ADMs in a general topology optical network
DISC'06 Proceedings of the 20th international conference on Distributed Computing
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Minimizing the number of ADMs in SONET rings with maximum throughput
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Optimal on-line colorings for minimizing the number of ADMs in optical networks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.01 |
SONET ADMs are dominant cost factors in WDM/SONET rings. Whereas most previous papers on the topic concentrated on the number of wavelengths assigned to a given set of lightpaths, more recent papers argue that the number of ADMs is a more realistic cost measure. Some of these works discuss various heuristic algorithms for this problem, and the best known result is a 3/2 approximation in [Traffic partition in wdm/sonet rings to minimize sonet adms]. Through the study of the re-lation between this problem and the problem of finding maximum disjoint rings in a given set of lightpaths we manage to shed more light onto this problem and to develop a 10/7 + 驴 approximation for it.