4131 search results - page 405 / 827 » The Generalized Max-Controlled Set Problem |
207
click to vote
RTCSA
2006
IEEE
16 years 1 months ago
2006
IEEE
(m,k)-firm constraints have been used to schedule tasks in soft/firm real-time systems under overloaded conditions. In general, they are provided by application designers to guara...
202
click to vote
ACMSE
2006
ACM
16 years 1 months ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
201
click to vote
PODC
2005
ACM
16 years 1 months ago
2005
ACM
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...
189
click to vote
APPROX
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
210
click to vote
ESA
2005
Springer
16 years 1 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...