Channel coding considerations for wireless LANs
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 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.
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
Jaione Tirapu Azpiroz, Alan E. Rosenbluth, et al.
SPIE Photomask Technology + EUV Lithography 2009
Chai Wah Wu
Linear Algebra and Its Applications
Fernando Martinez, Juntao Chen, et al.
AAAI 2025