Advertisement

High Spies (or How to Win a Programming Contest)

  • André Deutz
  • Rudy van Vliet
  • Hendrik Jan Hoogeboom
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4475)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [kFordFulkerson1957]
    Ford Jr., L.R., Fulkerson, D.R.: A simple algorithm for finding maximal network flows and an application to the Hitchcock problem. Canadian Journal of Mathematics 9, 210–218 (1957)MathSciNetCrossRefzbMATHGoogle Scholar
  2. [kShasha2003]
    Shasha, D.E.: Puzzling adventures: High spies. Scientific American 289(1), 80 (2003)CrossRefGoogle Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • André Deutz
    • 1
  • Rudy van Vliet
    • 1
  • Hendrik Jan Hoogeboom
    • 1
  1. 1.Leiden Institute of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333 CA LeidenThe Netherlands

Personalised recommendations