5 search results - page 1 / 1 » Popular Matchings in the Capacitated House Allocation Proble... |
ESA
2006
Springer
13 years 11 months ago
2006
Springer
JDA
2010
13 years 5 months ago
2010
ISAAC
2004
Springer
14 years 23 days ago
2004
Springer
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...