657 search results - page 129 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
DFG
2009
Springer
15 years 6 months ago
2009
Springer
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...
106
click to vote
MOR
2008
14 years 11 months ago
2008
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
110
click to vote
SIAMDM
2010
14 years 6 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
123
click to vote
MOBIHOC
2005
ACM
15 years 11 months ago
2005
ACM
The throughput of wireless networks can be significantly improved by multi-channel communications compared with single-channel communications since the use of multiple channels ca...
111
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...