4009 search results - page 573 / 802 » Clustering on Complex Graphs |
167
click to vote
PODC
2005
ACM
16 years 4 days ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
187
click to vote
PPOPP
2005
ACM
16 years 4 days ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
171
click to vote
SPAA
2005
ACM
16 years 4 days ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
183
click to vote
DIALM
2004
ACM
16 years 10 hour ago
2004
ACM
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...
161
click to vote
IWPEC
2004
Springer
15 years 12 months ago
2004
Springer
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...