Approximating k-hop Minimum Spanning Trees in Euclidean Metrics

Laue, Sören; Matijevic, Domagoj

doi:10.1016/j.ipl.2008.01.004

Local TagsRelease HistoryDetailsSummary

Approximating k-hop Minimum Spanning Trees in Euclidean Metrics

Laue, S., & Matijevic, D. (2008). Approximating k-hop Minimum Spanning Trees in Euclidean Metrics. Information Processing Letters, 107(3/4), 96-101. doi:10.1016/j.ipl.2008.01.004.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1AFE-3 Version Permalink: https://hdl.handle.net/21.11116/0000-0001-9BD5-0

Genre: Journal Article

Latex : Approximating k-hop Minimum Spanning trees in {E}uclidean Metrics

Files

show Files

Locators

show

Creators

show

hide

Creators:
Laue, Sören¹, Author
Matijevic, Domagoj¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2009-03-25Published Online: 2008Date issued: 2008

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 428147
BibTex Citekey: Laue2008
DOI: 10.1016/j.ipl.2008.01.004
URI: http://dx.doi.org/10.1016/j.ipl.2008.01.004
Other: Local-ID: C125756E0038A185-41D24509531D02C7C125757B00431EE1-Laue2008

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Information Processing Letters

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Amsterdam : Elsevier

Pages: - Volume / Issue: 107 (3/4) Sequence Number: - Start / End Page: 96 - 101 Identifier: ISSN: 0020-0190
CoNE: https://pure.mpg.de/cone/journals/resource/954921346222