A software package of algorithms and heuristics for disjoint paths in Planar Networks

A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks

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, t...

متن کامل

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

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, t...

متن کامل

Planet a Software Package of Algorithms and Heuristics on Planar Networks 1

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, t...

متن کامل

Disjoint Paths in Planar Graphs

ACKNOWLEDGEMENTS My thanks first to my advisor, Xingxing Yu. He has helped me find my strengths, and directed me toward questions which truly intrigue me. He kept me moving forward in moments of frustration, set high expectations, and provided support for me to meet them. their service on my thesis committee. I would also like to thank Robin Thomas and the rest of the faculty at Georgia Tech fo...

متن کامل

Local Search Heuristics for Disjoint Connecting Paths

Kleinberg’s algorithm, for the maximum disjoint connecting paths problem (max DCP) between k terminal pairs, obtains an approximate solution by routing each terminal pair in turn via the shortest path, deleting each shortest path before routing the next terminal pair, until no such path exists. We suggest that the number of terminal pairs routed is dependent on the order in which the terminal p...

متن کامل

A software package of algorithms and heuristics for disjoint paths in Planar Networks

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

منابع مشابه