Sciweavers

415 search results - page 34 / 83
» An efficient approximation for the Generalized Assignment Pr...
Sort
View
INFOCOM
1997
IEEE
15 years 5 months ago
Server Selection Using Dynamic Path Characterization in Wide-Area Networks
Replication is a commonly proposed solution to problems of scale associated with distributed services. However, when a service is replicated, each client must be assigned a server...
Robert L. Carter, Mark Crovella
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 1 months ago
Restricted Strip Covering and the Sensor Cover Problem
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh...
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
16 years 1 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
MP
2006
138views more  MP 2006»
15 years 1 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...
SPAA
2009
ACM
16 years 1 months ago
Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network desi
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
Melih Onus, Andréa W. Richa