453 search results - page 31 / 91 » On Approximation of Bookmark Assignments |
SIAMDM
2002
13 years 8 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
AAIM
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
WAOA
2004
Springer
14 years 2 months ago
2004
Springer
SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and...
WAOA
2005
Springer
14 years 2 months ago
2005
Springer
We consider an optical routing problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic...
TON
1998
13 years 8 months ago
1998
Abstract—In this paper we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuitswitching. The conventional approaches to address this ...