ALGORITHMICA
2010
13 years 5 months ago
2010
Knuth [14] asked whether the stable matching problem can be generalised to three dimensions i. e., for families containing a man, a woman and a dog. Subsequently, several authors ...
ALGORITHMICA
2010
13 years 5 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...
ALGORITHMICA
2010
13 years 5 months ago
2010
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
ALGORITHMICA
2010
13 years 5 months ago
2010
ALGORITHMICA
2010
13 years 5 months ago
2010
ALGORITHMICA
2010
13 years 5 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 5 months ago
2010
We describe space-efficient algorithms for solving problems related to finding maxima among points in two and three dimensions. Our algorithms run in optimal O(n log n) time and oc...
ALGORITHMICA
2010
13 years 5 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 5 months ago
2010
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
ALGORITHMICA
2010
13 years 5 months ago
2010
Abstract. This paper presents algorithms whose input is an undirected graph, and whose output is a tree decomposition of width that approximates the optimal, the treewidth of that ...