Sciweavers

61 search results - page 9 / 13
» Approximation Algorithms for Survivable Optical Networks
Sort
View
ESA
2005
Springer
145views Algorithms» more  ESA 2005»
14 years 1 months ago
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
André Berger, Artur Czumaj, Michelangelo Gr...
INFOCOM
2006
IEEE
14 years 1 months ago
Complexity of Wavelength Assignment in Optical Network Optimization
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
Matthew Andrews, Lisa Zhang
BROADNETS
2007
IEEE
14 years 1 months ago
Online broadcasting and multicasting in WDM networks with shared light splitter bank
— In this paper we deal with online broadcasting and multicasting in a WDM optical network with shared light splitter bank. Our objective is to maximize the network throughput. S...
Weifa Liang, Yuzhen Liu
ICALP
2010
Springer
14 years 10 days ago
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
George B. Mertzios, Ignasi Sau, Mordechai Shalom, ...
FSTTCS
2009
Springer
14 years 2 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi