Approximating pathwidth for graphs of small treewidth

We describe a polynomial-time algorithm which, given a graph G with treewidth t, approximates the pathwidth of G to within a ratio of [EQUATION]. This is the first algorithm to achieve an f(t)-approximation for some function f.