630 search results - page 21 / 126 » Hardness results for approximating the bandwidth |
172
click to vote
APPROX
2010
Springer
15 years 7 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
168
click to vote
ATAL
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Control for agents situated in multi-agent systems is a complex problem. This is particularly true in hard, open, dynamic environments where resource, privacy, bandwidth,...
163
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
172
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The underwater acoustic channel is characterized by a path loss that depends not only on the transmission distance, but also on the signal frequency. As a consequence, transmission...
154
click to vote
FOCS
2007
IEEE
16 years 13 days ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...