JDA
2008
13 years 4 months ago
2008
Partitioning a permutation into a minimum number of monotone subsequences is NP-hard. We extend this complexity result
JDA
2008
13 years 4 months ago
2008
The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is (n3.5 log n) ; bu...
JDA
2008
13 years 4 months ago
2008
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
JDA
2008
13 years 4 months ago
2008
JDA
2008
13 years 4 months ago
2008
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
JDA
2008
13 years 4 months ago
2008
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...
JDA
2008
13 years 4 months ago
2008
JDA
2008
13 years 4 months ago
2008
We study the problem of on-line scheduling of parallel jobs on two machines. The jobs are parallel in the sense that each of them specifies the number of processors, in this case ...
JDA
2008
13 years 4 months ago
2008