My Research (B.Y. Wu)

bulletMy research  1995-2004 (in Chinese) 

bulletnew version my research 1995-2006 (in Chinese) 

bulletMy publication

bulletComputational biology:
  1. Evolutionary tree reconstruction
  2. Rooting an ultrametric tree
  3. ConTrip: constructing the maximum consensus tree
  4. DPWP : A new heuristic algorithm for triplet methods (ICS02)

bullet(Approximation) algorithms

  1. The minimum routing cost spanning tree problem: see the  PowerPoint file for some of our results on this problem.
  2. The Maximum Eccentricity Spanning Trees, PowerPoint file
  3. Approximation Algorithms and Spanning Trees: PowerPoint file
  4. The uniform splitting of a tree: PowerPoint file
  5. A method combining DP and B&B:
    a case study on the minimum latency problem: PowerPoint file
  6. The swap edges for a multiple-sources routing tree: PowerPoint file
  7. Performances of the List Scheduling for some set partition problem: PowerPoint file
bulletOther talks
  1. Approximation algorithm Design -- a case study of MRCT (2006/11/20 @ CS.CCU)
  2. Social network analysis & friend network in blogosphere

    　

　

　

bulletSpanning Trees and Optimization Problems

bullet

 (link to book homepage)

bullet

A cool Flash book cover

bullet

About the authors

bullet

Contents

　

 A k-star -- a good approximation for the minimum routing cost spanning tree

　

　

back to my home