Optimal arrangement of data in a tree directory

  • Authors:

  • M. J. Luczak;S. D. Noble

  • Affiliations:

  • Mathematical Institute, 24-29 St. Giles, Oxford, OX1 3LB, UK;Department of Mathematical Sciences, Brunel University, Kingston Lane, Uxbridge, UB8 3PH, UK

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2002

Quantified Score

Hi-index 0.04

Visualization

Abstract

We define the decision problem DATA ARRANGEMENT, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between pairs of vertices measured with respect to the tree topology is at most a given value. We show that DATA ARRANGEMENT is strongly NP-complete for any fixed d ≥ 2 and explain the connection between DATA ARRANGEMENT and arranging data in a particular form of distributed directory.