ALGORITHMICA
2010
13 years 11 months ago
2010
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
ALGORITHMICA
2010
13 years 11 months ago
2010
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
ALGORITHMICA
2010
13 years 11 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
ALGORITHMICA
2010
13 years 11 months ago
2010
Abstract Winfree's pioneering work led the foundations in the area of errorreduction in algorithmic self-assembly (Winfree and Bekbolatov in DNA Based Computers 9, LNCS, vol. ...
ALGORITHMICA
2010
13 years 11 months ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
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
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...
ALGORITHMICA
2010
13 years 11 months ago
2010
