Optical networks and the related technologies, network management software and services
have undergone remarkable developments, and such networks are now the ultra-high …

In this paper we show that approximation algorithms for the weighted independent set and s-
dimensional knapsack problem with ratio a can be turned into approximation algorithms with …

We study the complexity of a set of design problems for optical networks. Under wavelength
division multiplexing (WDM) technology, demands sharing a common fiber are transported …

We consider the problem of minimizing the amount of deployed fiber in optical networks in
which each fiber carries a fixed number of wavelengths. We are given a network of general …

In this paper, we study multi-fiber optical networks with wavelength division multiplexing
(WDM). We extend the definition of the well-known Wavelength Assignment Problem (WAP) …

We study computationally hard combinatorial problems arising from the important
engineering question of how to maximize the number of connections that can be …

We consider the problem of assigning wavelengths to demands in an optical network of m
links. We assume that the route of each demand is fixed and the number of wavelengths …

We propose an algorithm for approximately solving the mixed packing and covering
problem; given a convex compact set 0̸≠ B⊆ RN, either compute x∈ B such that f (x)≤(1+ …

We propose an approximation algorithm for the general max-min resource sharing problem
with M nonnegative concave constraints on a convex set B. The algorithm is based on a …

Wavelength division multiplexed (WDM) optical communication offers the advantages of
increased capacity and decreased latency for signals (traffic) carried across such networks …