192 search results - page 38 / 39 » A Constant-Factor Approximation Algorithm for the Multicommo... |
INFOCOM
2006
IEEE
13 years 11 months ago
2006
IEEE
— 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...
SPAA
2004
ACM
13 years 10 months ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
POPL
2006
ACM
14 years 5 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
IPPS
2009
IEEE
13 years 11 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
IROS
2009
IEEE
13 years 11 months ago
2009
IEEE
— We study a path planning problem which arises when multiple robots are used to gather data from stationary devices with wireless communication capabilities. Each device has a g...