Opening book details…
Can I read Optimal arrangement of data in a tree directory: [Discrete Appl. Math 113 (2001) 243–253] on EtoBox?
Optimal arrangement of data in a tree directory: [Discrete Appl. Math 113 (2001) 243–253] by M.J. Luczak; S.D. Noble is a Computer Science article available to read on EtoBox.
What is Optimal arrangement of data in a tree directory: [Discrete Appl. Math 113 (2001) 243–253] about?
We deÿne 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 ÿxed d ¿ 2 and explain the connection between DATA ARRANGEMENT and arranging data in a particular form of distributed directory.
Who reads Optimal arrangement of data in a tree directory: [Discrete Appl. Math 113 (2001) 243–253]?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- M.J. Luczak; S.D. Noble
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0166-218X)
- Published
- 2002
- Language
- EN
- Field
- Computer Science (Physical Sciences)