From balls and bins to points and vertices

Ralf Klasing, Zvi Lotker, Alfrede Navarra, Stephane Perennes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations


Given a graph G = (V, E) with \V\ = n, we consider the following problem. Place n points on the vertices of G independently and uniformly at random. Once the points are placed, relocate them using a bijection from the points to the vertices that minimizes the maximum distance between the random place of the points and their target vertices. We look for an upper bound on this maximum relocation distance that holds with high probability (over the initial placements of the points). For general graphs, we prove the #P-hardness of the problem and that the maximum relocation distance is O(√n) with high probability. We also present a Fully Polynomial Randomized Approximation Scheme when the input graph admits a polynomial-size family of witness cuts while for trees we provide a 2-approximation algorithm.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 16th International Symposium, ISAAC 2005, Proceedings
Number of pages10
StatePublished - 1 Dec 2005
Externally publishedYes
Event16th International Symposium on Algorithms and Computation, ISAAC 2005 - Hainan, China
Duration: 19 Dec 200521 Dec 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3827 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference16th International Symposium on Algorithms and Computation, ISAAC 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'From balls and bins to points and vertices'. Together they form a unique fingerprint.

Cite this