2698 search results - page 156 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
236
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
162
click to vote
ICTCS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
160
click to vote
WG
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
153
click to vote
QEST
2006
IEEE
16 years 14 days ago
2006
IEEE
We give a quick overview of some key issues in (quantitative) call center management: building realistic models, developing efficient tools to simulate these models, finding qui...
173
click to vote
MICS
2010
15 years 4 months ago
2010
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...