We show that the standard linear programming relaxation for the tree augmentation problem in undirected graphs has an integrality ratio that approaches 3 2 . This refutes a conjecture of Cheriyan, Jord
Joseph Cheriyan, Howard J. Karloff, Rohit Khandeka