40 search results - page 3 / 8 » approx 2007 |
APPROX
2007
Springer
14 years 2 months ago
2007
Springer
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
APPROX
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We co...
APPROX
2007
Springer
14 years 2 months ago
2007
Springer
We study the cover time of a random walk on the random digraph Dn,p when np =
APPROX
2007
Springer
14 years 2 months ago
2007
Springer
It is known that online knapsack is not competitive. This negative result remains true even if the items are removable. In this paper we consider online removable knapsack with