1439 search results - page 36 / 288 » Fast approximation of centrality |
118
Voted
WEA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
136
Voted
SIAMCOMP
1998
15 years 2 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
92
Voted
ICRA
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract— In this paper we present two task-allocation strategies for a multi-robot transportation system. The first strategy is based on a centralized planner that uses domain ...
118
Voted
SDM
2009
SIAM
15 years 12 months ago
2009
SIAM
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
119
Voted
PPSC
1997
15 years 4 months ago
1997
It seems likely that improvements in arithmetic speed will continue to outpace advances in communication bandwidth. Furthermore, as more and more problems are working on huge datas...