459 search results - page 5 / 92 » Approximation Algorithms for Buy-at-Bulk Geometric Network D... |
157
click to vote
MOBIHOC
2002
ACM
16 years 3 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
125
Voted
ICC
2008
IEEE
15 years 10 months ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
91
Voted
IJCAI
2003
15 years 4 months ago
2003
The structural rigidity property, a generalization of Laman’s theorem which characterizes rigid bar frameworks in 2D, is generally considered a good approximation of rigidity in...
104
Voted
COMCOM
2008
15 years 3 months ago
2008
It is crucial to design an efficient network-aware overlay network to enable multicast service to adjust under the dynamic underlying network conditions and node churn in a scalab...
135
Voted
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...