Article ID: | iaor20001751 |
Country: | Netherlands |
Volume: | 92 |
Issue: | 2/3 |
Start Page Number: | 91 |
End Page Number: | 110 |
Publication Date: | Jun 1999 |
Journal: | Discrete Applied Mathematics |
Authors: | Wagner Dorothea, Brandes Ulrik, Schlickenrieder Wolfram, Neyer Gabriele, Weihe Karsten |
Keywords: | simulation |
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