On the integrality ratio for tree augmentation

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

• Type: Journal
• Year: 2008
• Where: ORL
• Authors: Joseph Cheriyan, Howard J. Karloff, Rohit Khandekar, Jochen Könemann
• Keywords: Integrality Ratio, Linear Programming Relaxation, ORL 2008, Tree Augmentation Problem