376 search results - page 4 / 76 » Betweenness Centrality : Algorithms and Lower Bounds |
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
Recent progress in Distributed Constraint Optimization Problems (DCOP) has led to a range of algorithms now available which differ in their amount of problem centralization. Probl...
94
Voted
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
81
Voted
PAKDD
2009
ACM
15 years 2 months ago
2009
ACM
We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
FAW
2009
Springer
15 years 2 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...