Luczak, M.J. and Noble, S.D. (2002) Optimal arrangement of data in a tree directory. Discrete Applied Mathematics 121 (1-3), pp. 307-315. ISSN 0166-218X.
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.
Metadata
| Item Type: | Article |
|---|---|
| Additional Information: | https://bura.brunel.ac.uk/bitstream/2438/1676/1/revsubitted.pdf |
| School: | Birkbeck Faculties and Schools > Faculty of Business and Law > Birkbeck Business School |
| Depositing User: | Sarah Hall |
| Date Deposited: | 20 Jul 2020 13:11 |
| Last Modified: | 02 Aug 2023 18:01 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/32606 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
