3678 search results - page 7 / 736 » On the Stable Paths Problem |
MOBIHOC
2003
ACM
14 years 9 months ago
2003
ACM
ALGORITHMICA
2010
13 years 10 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
WADS
2009
Springer
14 years 4 months ago
2009
Springer
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fréchet distance, and the diameter for a polyhedral surface. Distances on the surface a...
CP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...