552 search results - page 4 / 111 » Lower bounds for dynamic connectivity |
STOC
2010
ACM
14 years 3 months ago
2010
ACM
We consider a number of dynamic problems with no known poly-logarithmic upper bounds, and show that they require n(1) time per operation, unless 3SUM has strongly subquadratic alg...
JPDC
1998
13 years 6 months ago
1998
IPL
2010
13 years 4 months ago
2010
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...
ENDM
2010
13 years 6 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
A lower bound on the minimum mean-squared error (MSE) in a Bayesian estimation problem is proposed in this paper. This bound utilizes a well-known connection to the deterministic e...