4843 search results - page 377 / 969 » The Shortcut Problem - Complexity and Approximation |
132
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
131
click to vote
ESA
2003
Springer
15 years 9 months ago
2003
Springer
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
124
click to vote
ICTCS
2003
Springer
15 years 9 months ago
2003
Springer
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
158
click to vote
BIRTHDAY
2009
Springer
15 years 8 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
179
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...