41 search results - page 3 / 9 » isaac 2003 |
ISAAC
2003
Springer
14 years 3 months ago
2003
Springer
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...
ISAAC
2003
Springer
14 years 3 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...
ISAAC
2003
Springer
14 years 3 months ago
2003
Springer
We consider the problem of characterizing user equilibria and optimal solutions for selfish routing in a given network. We extend the known models by considering malicious behavio...
ISAAC
2003
Springer
14 years 3 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
14 years 3 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...