PlaNet : A Software Package of Algorithms and Heuristics on Planar Networks

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:52e949d78cea9938fd1abe99f4811d08

BRANDES, Ulrik, Gabriele NEYER, Wolfram SCHICKENRIEDER, Dorothea WAGNER, Karsten WEIHE, 1999. PlaNet : A Software Package of Algorithms and Heuristics on Planar Networks. In: Discrete Applied Mathematics. 92(2-3), pp. 91-110. ISSN 0166-218X. eISSN 1872-6771

@article{Brandes1999PlaNe-5854, title={PlaNet : A Software Package of Algorithms and Heuristics on Planar Networks}, year={1999}, doi={10.1016/S0166-218X(99)00048-7}, number={2-3}, volume={92}, issn={0166-218X}, journal={Discrete Applied Mathematics}, pages={91--110}, author={Brandes, Ulrik and Neyer, Gabriele and Schickenrieder, Wolfram and Wagner, Dorothea and Weihe, Karsten} }

<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/5854"> <dcterms:abstract xml:lang="eng">We present a package for algorithms on planar networks. This package comes with a graphical user interface, which may be used for demonstrating and animating algorithms. Our focus so far has been on disjoint path problems. However, the package is intended to serve as a general framework, wherein algorithms for various problems on planar networks may be integrated and visualized. For this aim, the structure of the package is designed so that integration of new algorithms and even new algorithmic problems amounts to applying a short "recipe". The package has been used to develop new variations of well--known disjoint path algorithms, which heuristically optimize additional NP--hard objectives such as the total length of all paths. We will prove that the problem of finding edge--disjoint paths of minimum total length in a planar graph is NP--hard, even if all terminals lie on the outer face, the Eulerian condition is fulfilled, and the maximum degree is four. Finally, we will report results of experimental studies on efficient heuristics for this problem.</dcterms:abstract> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5854"/> <dc:contributor>Weihe, Karsten</dc:contributor> <dc:creator>Neyer, Gabriele</dc:creator> <dc:creator>Schickenrieder, Wolfram</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:42Z</dcterms:available> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dcterms:issued>1999</dcterms:issued> <dc:contributor>Neyer, Gabriele</dc:contributor> <dc:language>eng</dc:language> <dc:contributor>Wagner, Dorothea</dc:contributor> <dc:creator>Brandes, Ulrik</dc:creator> <dc:format>application/pdf</dc:format> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:42Z</dc:date> <dc:creator>Weihe, Karsten</dc:creator> <dc:contributor>Brandes, Ulrik</dc:contributor> <dc:creator>Wagner, Dorothea</dc:creator> <dcterms:bibliographicCitation>First publ. in: Discrete Applied Mathematics 92 (1999), 2-3, pp. 91-110</dcterms:bibliographicCitation> <dcterms:title>PlaNet : A Software Package of Algorithms and Heuristics on Planar Networks</dcterms:title> <dc:contributor>Schickenrieder, Wolfram</dc:contributor> <dc:rights>deposit-license</dc:rights> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

PlaNet.pdf 129

Das Dokument erscheint in:

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

KOPS Suche


Stöbern

Mein Benutzerkonto