Sciweavers

632 search results - page 102 / 127
» On the Approximability of the Steiner Tree Problem
Sort
View
APPROX
2004
Springer
120views Algorithms» more  APPROX 2004»
14 years 1 months ago
Simultaneous Source Location
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
Konstantin Andreev, Charles Garrod, Bruce M. Maggs...
CATS
2006
13 years 9 months ago
Graph Orientation Algorithms to Minimize the Maximum Outdegree
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei ...
INFOCOM
2007
IEEE
14 years 1 months ago
Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
David Amzallag, Joseph Naor, Danny Raz
STACS
2001
Springer
14 years 1 days ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
FOCM
2010
100views more  FOCM 2010»
13 years 6 months ago
Higher-Order Averaging, Formal Series and Numerical Integration I: B-series
We show how B-series may be used to derive in a systematic way the analytical expressions of the high-order stroboscopic averaged equations that approximate the slow dynamics of h...
P. Chartier, A. Murua, J. M. Sanz-Serna