On-Line Matching Routing on Trees

Roberts, A; Symvonis, A

dc.contributor.author	Roberts, A	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T02:48:38Z
dc.date.available	2014-03-01T02:48:38Z
dc.date.issued	1998	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33978
dc.relation.uri	http://147.102.205.75/~symvonis/publications/conferences/rs-latin98.pdf	en
dc.relation.uri	http://www.springerlink.com/content/k753133354r8u7u0	en
dc.relation.uri	http://www.springerlink.com/index/k753133354r8u7u0.pdf	en
dc.relation.uri	http://www.sciencedirect.com/science/article/pii/S0304397599000109	en
dc.relation.uri	http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs220.html#RobertsS99	en
dc.relation.uri	http://linkinghub.elsevier.com/retrieve/pii/S0304397599000109	en
dc.relation.uri	http://dx.doi.org/10.1016/S0304-3975(99)00010-9	en
dc.subject	Matching Model	en
dc.subject	Maximum Degree	en
dc.subject	On-line Algorithm	en
dc.subject	Permutation Routing	en
dc.subject	Rooted Tree	en
dc.title	On-Line Matching Routing on Trees	en
heal.type	conferenceItem	en
heal.publicationDate	1998	en
heal.abstract	Abstract. We examine on-line heap construction and on-line permutation routing on trees under the matching model. Let T be and n-node tree of maximum,degree d. By providing on-line algorithms we 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	en
heal.journalName	Latin American Theoretical INformatics	en