570 search results - page 16 / 114 » Approximating Some Network Design Problems with Node Costs |
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
GLOBECOM
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract— The design of efficient and scalable streaming Content Distribution Networks (CDNs) is an open problem of great economic interest. A key decision is the number of repl...
JUCS
2006
13 years 8 months ago
2006
: The growth of sensor networks during the last years is a fact and within this field, wireless sensor networks are growing particularly as there are many applications that demand ...
ICPPW
2002
IEEE
14 years 1 months ago
2002
IEEE
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
ICPADS
2002
IEEE
14 years 1 months ago
2002
IEEE
Network emulation systems are widely used to explore the behavior of network protocols and to test and evaluate protocol implementations and applications. The major problem of net...