Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   examine on-line heap construction and on-line permutation routing on trees under the matching model. Let T be an n-node tree of maximum degree d. By providing on-line algorithms  prove that: (1) For a rooted tree of height h, on-line heap construction can be completed within (2d 1)h routing steps. (2) For an arbitrary tree, on-line permutation routing can be completed within 4dn routing steps. (3) For a complete d-ary tree, on-line permutation routing can be completed within 2(d 1)n+2dlog 2 n routing steps. c 1999 Elsevier Science B.V. All rights reserved.
['Alan Roberts', 'Antonios Symvonis']
I am writing a research paper on a idea On-line matching routing on trees
[{"from": "human", "value": "I am writing a research paper on a idea On-line matching routing on trees"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   examine on-line heap construction and on-line permutation routing on trees under the matching model. Let T be an n-node tree of maximum degree d. By providing on-line algorithms  prove that: (1) For a rooted tree of height h, on-line heap construction can be completed within (2d 1)h routing steps. (2) For an arbitrary tree, on-line permutation routing can be completed within 4dn routing steps. (3) For a complete d-ary tree, on-line permutation routing can be completed within 2(d 1)n+2dlog 2 n routing steps. c 1999 Elsevier Science B.V. All rights reserved."}]