Sciweavers

570 search results - page 2 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
ICC
2008
IEEE
137views Communications» more  ICC 2008»
13 years 11 months ago
Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints
The notion of Shared Risk Resource Groups (SRRG) has been introduced to capture survivability issues when a set of resources may fail simultaneously. Applied to Wavelength Divisio...
David Coudert, Florian Huc, Fabrice Peix, Marie-Em...
CORR
2011
Springer
179views Education» more  CORR 2011»
12 years 8 months ago
Approximating minimum-power edge-multicovers
Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by appli...
Nachshon Cohen, Zeev Nutov
ALGORITHMICA
2005
99views more  ALGORITHMICA 2005»
13 years 4 months ago
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs...
TALG
2008
111views more  TALG 2008»
13 years 4 months ago
On the approximability of some network design problems
Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh ...
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
13 years 10 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang