Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
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.
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
D.S. Turaga, K. Ratakonda, et al.
SCC 2006
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009