External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Strong Inapproximability of the Basic ::::k::::-Spanner Problem

Michael Elkin, David Peleg. Strong Inapproximability of the Basic ::::k::::-Spanner Problem. In Ugo Montanari, José D. P. Rolim, Emo Welzl, editors, Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings. Volume 1853 of Lecture Notes in Computer Science, pages 636-647, Springer, 2000. [doi]

Authors

Michael Elkin

This author has not been identified. Look up 'Michael Elkin' in Google

David Peleg

This author has not been identified. Look up 'David Peleg' in Google
runs on