Zobrazeno 1 - 10
of 117
pro vyhledávání: '"KENYON, CLAIRE"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
The Sum of Squares algorithm for bin packing was defined in [2] and studied in great detail in [1], where it was proved that its worst case performance ratio is at most 3. In this note, we improve the asymptotic worst case bound to 2.7777...
Externí odkaz:
http://arxiv.org/abs/cs/0509031
Publikováno v:
Information Processing Letters 97:68-72(2006)
The Reverse Greedy algorithm (RGreedy) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the resulting total distance from the customers to the remaining facilitie
Externí odkaz:
http://arxiv.org/abs/cs/0504104
Publikováno v:
Algorithmica 50(4):455-478(2008)
In the k-median problem we are given sets of facilities and customers, and distances between them. For a given set F of facilities, the cost of serving a customer u is the minimum distance between u and a facility in F. The goal is to find a set F of
Externí odkaz:
http://arxiv.org/abs/cs/0504103
We study continuous time Glauber dynamics for random configurations with local constraints (e.g. proper coloring, Ising and Potts models) on finite graphs with $n$ vertices and of bounded degree. We show that the relaxation time (defined as the recip
Externí odkaz:
http://arxiv.org/abs/math/0308284
Autor:
Csirik, Janos, Johnson, David S., Kenyon, Claire, Orlin, James B., Shor, Peter W., Weber, Richard R.
In this paper we present a theoretical analysis of the deterministic on-line {\em Sum of Squares} algorithm ($SS$) for bin packing introduced and studied experimentally in \cite{CJK99}, along with several new variants. $SS$ is applicable to any insta
Externí odkaz:
http://arxiv.org/abs/cs/0210013
The data broadcast problem is to find a schedule for broadcasting a given set of messages over multiple channels. The goal is to minimize the cost of the broadcast plus the expected response time to clients who periodically and probabilistically tune
Externí odkaz:
http://arxiv.org/abs/cs/0205012
Autor:
Kenyon, Claire, Rémila, Eric
Publikováno v:
Mathematics of Operations Research, 2000 Nov 01. 25(4), 645-656.
Externí odkaz:
https://www.jstor.org/stable/3690505
Publikováno v:
The Annals of Applied Probability, 2000 May 01. 10(2), 410-433.
Externí odkaz:
https://www.jstor.org/stable/2667156
Publikováno v:
Mathematics of Operations Research, 2006 Feb 01. 31(1), 31-49.
Externí odkaz:
https://www.jstor.org/stable/25151706