78 search results - page 11 / 16 » Covering minimum spanning trees of random subgraphs |
151
click to vote
STOC
1996
ACM
15 years 8 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
168
click to vote
CISS
2007
IEEE
15 years 8 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
129
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
154
click to vote
JACM
2010
15 years 2 months ago
2010
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
197
click to vote
MOBIHOC
2012
ACM
13 years 7 months ago
2012
ACM
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...