51 search results - page 6 / 11 » algorithmica 2010 |
ALGORITHMICA
2010
13 years 11 months ago
2010
We consider the following version of the stable matching problem. Suppose that men have preferences for women, women have preferences for dogs, and dogs have preferences for men. T...
ALGORITHMICA
2010
13 years 11 months ago
2010
We present a universal algorithm for the classical online problem of caching or demand paging. We consider the caching problem when the page request sequence is drawn from an unkn...
ALGORITHMICA
2010
13 years 11 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
ALGORITHMICA
2010
13 years 11 months ago
2010
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...
ALGORITHMICA
2010
13 years 11 months ago
2010
Let I be a stable matching instance with N stable matchings. For each man m, order his (not necessarily distinct) N partners from his most preferred to his least preferred. Denote...