2031 search results - page 51 / 407 » On Tree-Constrained Matchings and Generalizations |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The stable marriage problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to...
WDAG
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
ICALP
2009
Springer
15 years 4 months ago
2009
Springer
We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly inv...
153
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
The difficulty inherent in schema matching has led to the development of several generic match algorithms. This paper describes how we adapted general approaches to the specific t...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
Service matchmaking is the process of finding suitable services given by the providers for the service requests of consumers. Previous approaches to service matchmaking is mostly ...