2714 search results - page 40 / 543 » Approximation Schemes for Scheduling |
89
Voted
CCE
2010
14 years 10 months ago
2010
MOC
2010
14 years 7 months ago
2010
148
Voted
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...
102
Voted
CORR
2007
Springer
15 years 13 days ago
2007
Springer
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
JPDC
2007
15 years 10 days ago
2007
We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of 3 2 + √ 2....