14 search results - page 1 / 3 » MST construction in O(log log n) communication rounds |
75
Voted
SPAA
2003
ACM
15 years 5 months ago
2003
ACM
104
click to vote
ADHOCNOW
2008
Springer
15 years 6 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
STOC
2009
ACM
16 years 9 days ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
ECCC
2006
14 years 11 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
108
click to vote
STOC
2006
ACM
16 years 12 hour ago
2006
ACM
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...