Two new and 'more difficult' channel routing problems

The novel and more difficult channel routing problems are proposed. Each is a simple transformation of the original that maintains all the old vertical constraints but adds an equivalent new set resulting in cycles (none were present previously). These variations can be considered gridless.<
>