کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
430984 | 688239 | 2007 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Optimal leaf ordering of complete binary trees
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Optimal leaf ordering of complete binary trees Optimal leaf ordering of complete binary trees](/preview/png/430984.png)
چکیده انگلیسی
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NPNP-hard in general, it becomes polynomially solvable if the set of feasible permutations is restricted to be compatible with a tree of bounded degree. We present a new algorithm for the elementary case of ordering the n leaves of a binary tree with height logn+O(1)logn+O(1). Our algorithm requires O(n2logn)O(n2logn) time and O(n)O(n) space. While the running time is a log-factor away from being asymptotically optimal, the algorithm is conceptually simple, easy to implement, and highly practical. Its implementation requires little more than a few bit-manipulations.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Discrete Algorithms - Volume 5, Issue 3, September 2007, Pages 546–552
Journal: Journal of Discrete Algorithms - Volume 5, Issue 3, September 2007, Pages 546–552
نویسندگان
Ulrik Brandes,