Journal Article
A NEARLY BEST-POSSIBLE APPROXIMATION ALGORITHM FOR NODE-WEIGHTED STEINER TREES
AN APPROXIMATE MAX-FLOW MIN-CUT RELATION FOR UNDIRECTED MULTICOMMODITY FLOW, WITH APPLICATIONS
OF MICE AND MEN - ALGORITHMS FOR EVOLUTIONARY DISTANCES BETWEEN GENOMES WITH TRANSLOCATION
WHEN TREES COLLIDE - AN APPROXIMATION ALGORITHM FOR THE GENERALIZED STEINER PROBLEM ON NETWORKS
ORDERING PROBLEMS APPROXIMATED - SINGLE-PROCESSOR SCHEDULING AND INTERVAL GRAPH COMPLETION
When trees collide: an approximation algorithm for the generalized Steiner problem on networks