David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
We consider the Survivable Network Design Problem (SNDP) and the Symmetric Traveling Salesman Problem (STSP). We give simpler proofs of the existence of a frac(1, 2)-edge and 1-edge in any extreme point of the natural LP relaxations for the SNDP and STSP, respectively. We formulate a common generalization of both problems and show our results by a new counting argument. We also obtain a simpler proof of the existence of a frac(1, 2)-edge in any extreme point of the set-pair LP relaxation for the element connectivitySurvivable Network Design Problem (SNDPe l t). © 2010 Elsevier B.V. All rights reserved.
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
Karthik Visweswariah, Sanjeev Kulkarni, et al.
IEEE International Symposium on Information Theory - Proceedings
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
J. LaRue, C. Ting
Proceedings of SPIE 1989