2137 search results - page 22 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
114
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We present fast algorithms for constructing probabilistic embeddings and approximate distance oracles in sparse graphs. The main ingredient is a fast algorithm for sampling the pr...
140
Voted
ICDT
2007
ACM
15 years 8 months ago
2007
ACM
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
115
click to vote
JDA
2008
15 years 1 months ago
2008
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
133
Voted
TAMC
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
127
click to vote
MOBIHOC
2007
ACM
16 years 1 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...