Statistical Clock Tree Routing:

Best existing work: Statistical Clock Tree Routing for Robustness to Process Variation

Uday Padmanabhan, Janet Wang and Jiang Hu

Some Potential Ways of Improvements:

a. The Elmore delay model is too coarse; Higher order model can be applied. (ref).

b. The algorithm is too heuristic. Mathematical programming can be applied.

S. Pullela, N. Menezes, and L. T. Pillage, "Reliable Non-Zero Skew Clock Trees Using Wire Width Optimization", DAC, pp. 165--170, 1993

B. Lu, J. Hu, G. Ellis, and H. Su, "Process Variation Aware Clock Tree Routing", ISPD, pp. 174--181, 2003

G. Venkataraman, C. N. Sze, and J. Hu, "Skew Scheduling and Clock Routing for Improved Tolerance to Process Variations", ASP-DAC, 594--599, 2005.

W. D. Lam and C.-K. Koh, "Process Variation Robust Clock Tree Routing," ASP-DAC, pp. 606--611, 2005.

Related:

Quadratic Statistical Timing model

Timing by high order RLS moments