On approximating arbitrary metrices by tree metrics
Bandwidth and low dimensional embedding
A better lower bound for on-line scheduling
Information Processing Letters
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC ’98
Theoretical Computer Science
Douglas E. Carroll
Yuval Rabani
Howard Karloff
Ofer Neiman
Adam Meyerson
Online load balancing on related machines
Bypassing the embedding
Metric embedding via shortest path decompositions