Sciweavers

93 search results - page 16 / 19
» Online Primal-Dual Algorithms for Covering and Packing Probl...
Sort
View
PODC
2005
ACM
14 years 1 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
JCSS
2007
89views more  JCSS 2007»
13 years 7 months ago
The relative worst-order ratio applied to paging
The relative worst order ratio, a new measure for the quality of on-line algorithms, was recently defined and applied to two bin packing problems. Here, we extend the definition ...
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
IPPS
2003
IEEE
14 years 25 days ago
Allocating Servers in Infostations for On-Demand Communications
Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation with Bounde...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 7 months ago
Trimmed Moebius Inversion and Graphs of Bounded Degree
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
WWW
2006
ACM
14 years 8 months ago
Visualizing tags over time
We consider the problem of visualizing the evolution of tags within the Flickr (flickr.com) online image sharing community. Any user of the Flickr service may append a tag to any ...
Micah Dubinko, Ravi Kumar, Joseph Magnani, Jasmine...