3192 search results - page 80 / 639 » The minimum latency problem |
127
Voted
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
139
Voted
ADHOCNOW
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
143
Voted
WG
2007
Springer
15 years 9 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
149
Voted
STACS
2001
Springer
15 years 8 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
111
click to vote
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
— The problem of resource allocation (RA) in a downlink OFDMA system with minimum user rate requests is examined under the realistic scenario of partial (imperfect) channel state...