2252 search results - page 304 / 451 » Lower Bounds for Dynamic Algorithms |
143
click to vote
CPC
2007
15 years 3 months ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
130
click to vote
ALGORITHMICA
2005
15 years 3 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
126
Voted
INFORMATICALT
2010
15 years 1 months ago
2010
We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical ne...
132
click to vote
ECCC
2011
14 years 10 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
166
Voted
SIGMOD
2012
ACM
13 years 6 months ago
2012
ACM
We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to h...