From: kenrose@nc-sys.com   
      
   > [There was a paper by Tom Szymanski in the CACM in the 1970s that   
   > explained how to calculate branch sizes.  The general problem is   
   > NP-complete, but as is usually the case with NP-complete problems,   
   > there is simple algorithm that gets you very close to the optimal   
   > result. -John]   
      
   Do you have a citation for that?  I searched through the CACM archive,   
   and I couldn't find anything by that author, not even with the   
   dubious-looking double "y" removed.   
      
   Thanks   
      
     - ken   
   [Sorry, now it's spelled right.  This question came 15 years ago. See   
   http://compilers.iecc.com/comparch/article/91-01-005 -John]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)