2924 search results - page 266 / 585 » Lower Bounds in Distributed Computing |
121
click to vote
MFCS
2001
Springer
15 years 8 months ago
2001
Springer
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
157
click to vote
SODA
2003
ACM
15 years 5 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
131
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
135
click to vote
MICAI
2005
Springer
15 years 9 months ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
141
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract—The problem of cooperative allocation among multiple secondary users to maximize cognitive system throughput is considered. The channel availability statistics are initi...