32 search results - page 7 / 7 » Tight Local Approximation Results for Max-Min Linear Program... |
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
BMCBI
2008
13 years 4 months ago
2008
Background: Testing for selection is becoming one of the most important steps in the analysis of multilocus population genetics data sets. Existing applications are difficult to u...