270 citations
- Institute for Solid State Physics and OpticsHU8 papers
- Hungarian Academy of SciencesHU7 papers
- London South Bank UniversityGB7 papers
- Max Planck Institute for Radio AstronomyDE7 papers
- University of AntwerpBE6 papers
- Centre National de la Recherche ScientifiqueFR4 papers
- University of Hong KongHK4 papers
- Center for Astrophysics Harvard & SmithsonianUS3 papers
- The University of SydneyAU3 papers
- AT&T (United States)US2 papers
- Brown UniversityUS2 papers
- California Institute of TechnologyUS2 papers
4 papers · 1 filter
Randomized algorithm for the k-server problem on decomposable spaces
Judit Nagy-György
We study the randomized k-server problem on metric spaces consisting of widely separated subspaces. We give a method which extends existing algorithms to larger spaces with the gro…
A randomized algorithm for the on-line weighted bipartite matching problem
Béla Csaba, András S. Pluhár
We study the on-line minimum weighted bipartite matching problem in arbitrary metric spaces. Here, not necessary disjoint points of a metric space are given, and are to be…
On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing
Janos Csirik, David S. Johnson, Claire Kenyon
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…
On the Sum-of-Squares Algorithm for Bin Packing
Janos Csirik, David S. Johnson, Claire Kenyon +3
In this paper we present a theoretical analysis of the deterministic on-line {\em Sum of Squares} algorithm () for bin packing introduced and studied experimentally in \cite{CJ…