CRoP is a library of algorithms for channel routing
problems that occur during the design process of
integrated circuits. Most of these algorithms are
really complex theoretical algorithms and are
implemented for the first time within CRoP. The main
goal of CRoP is to study and solve
implementation-related problems for theoretical
algorithms. But it can also be used to demonstrate and
teach these algorithms. The experiences made during the
developing time of CRoP lead to new theoretical
algorithmic results. Thus CRoP can also be seen as a
tool for "computer aided" resp. "experimental"
algorithm design. Some of the algorithms contained in
CRoP are heuristics whose practical value can be
verified only by computational results.
