Optimal Leaf Ordering of Complete Binary Trees

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:0dfbb363f80e044384eaafd39a0e1626

BRANDES, Ulrik, 2007. Optimal Leaf Ordering of Complete Binary Trees. In: Journal of Discrete Algorithms. 5(3), pp. 546-552

@article{Brandes2007Optim-3022, title={Optimal Leaf Ordering of Complete Binary Trees}, year={2007}, doi={10.1016/j.jda.2006.09.003}, number={3}, volume={5}, journal={Journal of Discrete Algorithms}, pages={546--552}, author={Brandes, Ulrik} }

<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/3022"> <dcterms:abstract xml:lang="eng">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 View the MathML source-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 View the MathML source. Our algorithm requires View the MathML source time and View the MathML source 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.</dcterms:abstract> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:48Z</dc:date> <dcterms:title>Optimal Leaf Ordering of Complete Binary Trees</dcterms:title> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dc:language>eng</dc:language> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/3022"/> <dcterms:issued>2007</dcterms:issued> <dc:contributor>Brandes, Ulrik</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:48Z</dcterms:available> <dc:rights>deposit-license</dc:rights> <dcterms:bibliographicCitation>Publ. in: Journal of Discrete Algorithms 5 (2007), 3, pp. 546-552</dcterms:bibliographicCitation> <dc:creator>Brandes, Ulrik</dc:creator> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Brandes_opus-117791.pdf 13

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Stöbern

Mein Benutzerkonto