True 3-D displays for avionics and mission crewstations
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
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.
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007