Counting minimum weight spanning trees. Choosing subsets with maximum weighted average. A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity. Data structures and optimal on-line search algorithms. Nili Guttmann-Beck and Refael Hassin .
Approximation algorithms for min-max tree partition.
Designing least-cost nonblocking broadband networks. References and Citations. Amihood Amir , Alberto Apostolico , and Moshe Lewenstein . Inverse pattern matching. Dany Breslauer , Tao Jiang , and Zhigen Jiang .