ISAAC
2003
Springer
13 years 9 months ago
2003
Springer
ISAAC
2003
Springer
13 years 9 months ago
2003
Springer
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi th...
ISAAC
2003
Springer
13 years 9 months ago
2003
Springer
Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We pr...
ISAAC
2003
Springer
13 years 9 months ago
2003
Springer
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...