Generating low-degree 2-spanners

SIAM Journal on Computing

Volumn 27, Issue 5, 1998, Pages 1438-1456

  Kortsarz, Guy ^a  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

Approximation; Graph spanners; Np hardness; Randomized rounding

Indexed keywords

EID: 0346181207     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794268753     Document Type: Article

References (4)

1. [ABP91] B. AWERBUCH, A. BARATZ, AND D. PELEG, Efficient Broadcast and Light-Weight Spanners, 1991, manuscript.
2. [ADDJ90] I. ALTHÖFER, G. DAS, D. DOBKIN, AND D. JOSEPH, Generating sparse spanners for weighted graphs, in Proc. 2nd Scandinavian Workshop on Algorithm Theory, Vol. LNCS-447, Springer-Verlag, Berlin, New York, 1990, pp. 26-37.
3. [AS92] N. ALON AND J. SPENCER, The Probabilistic Method, John Wiley and Sons Inc., New York, 1992.
4. [BGLR93] M. BELLARE, S. GOLDWASSER, C. LUND, AND A. RUSSELL, Efficient probabilistically checkable proofs: Applications to approximation, in Proc. 25th ACM Symposium on the Theory of Computing, 1993, pp. 294-304.