High Spies (or How to Win a Programming Contest)

We analyse transports between leaves in an edge-weighted tree. We prove under which conditions there exists a transport matching the weights of a given tree. We use this to compute minimum and maximum values for the transport between a given pair of leaves.

• Type: Conference
• Year: 2007
• Where: FUN
• Authors: André H. Deutz, Rudy van Vliet, Hendrik Jan Hoogeboom
• Keywords: Algorithms, Edge-weighted Tree, FUN 2007, Maximum Values, Transports