J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
We show that the standard linear programming relaxation for the tree augmentation problem in undirected graphs has an integrality ratio that approaches frac(3, 2). This refutes a conjecture of Cheriyan, Jordán, and Ravi [J. Cheriyan, T. Jordán, R. Ravi, On 2-coverings and 2-packings of laminar families, in: Proceedings, European Symposium on Algorithms, 1999, pp. 510-520. A longer version is on the web: http://www.math.uwaterloo.ca/jcheriyan/publications.html] that the integrality ratio is frac(4, 3). Crown Copyright © 2008.
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000