197 search results - page 21 / 40 » Simple deterministic approximation algorithms for counting m... |
ESA
1998
Springer
13 years 12 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
SAGT
2009
Springer
14 years 2 months ago
2009
Springer
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...
CEC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...