7930 search results - page 1355 / 1586 » Greedy in Approximation Algorithms |
169
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
155
click to vote
LCN
2006
IEEE
15 years 10 months ago
2006
IEEE
To support reliable multicast routing in wireless mesh networks, it is important to protect multicast sessions against link or node failures. The issue of protecting multicast ses...
137
click to vote
ACIVS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present an algorithm for interpolating the visible portions of a point cloud that are sampled from opaque objects in the environment. Our algorithm projects point clou...
143
click to vote
PODC
2006
ACM
15 years 10 months ago
2006
ACM
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...
142
Voted
SIGECOM
2005
ACM
15 years 10 months ago
2005
ACM
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...