Unbalanced points and vertices problem

Zvi Lotker, Alfredo Navarra

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

2 Scopus citations

Abstract

Starting from the Points and Vertices problem introduced in [9], given a graph G = (V, E] with |V|= n and a positive number ε, we consider the following problem. Place (1 - ε)n points on the vertices V of G independently and uniformly at random. Once the points are placed, relocate them by movements along the edges E of G using a function from the points to the vertices that minimizes the maximum distance between the random place of the points and their target vertices. The aim is to obtain in the final setting at most one point for each vertex. We look for an upper bound on this maximum relocation distance that holds with high probability over the initial placements of the points. We study several topologies for the graph G like paths, trees, d-dimensional grids, hypercubes and general graphs.

Original languageEnglish
Title of host publicationProceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006
Pages96-100
Number of pages5
DOIs
StatePublished - 31 Oct 2006
Externally publishedYes
Event4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006 - Pisa, Italy
Duration: 13 Mar 200617 Mar 2006

Publication series

NameProceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006
Volume2006

Conference

Conference4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006
Country/TerritoryItaly
CityPisa
Period13/03/0617/03/06

ASJC Scopus subject areas

  • Engineering (all)

Fingerprint

Dive into the research topics of 'Unbalanced points and vertices problem'. Together they form a unique fingerprint.

Cite this