Computing a minimum-dilation spanning tree is NP-hard

Cited 10 time in webofscience Cited 0 time in scopus
  • Hit : 1158
  • Download : 699
In a geometric network G = (S, E), the graph distance between two vertices u, nu is an element of S is the length of the shortest path in G connecting u to nu. The dilation of G is the maximum factor by which the graph distance of a pair of vertices differs from their Euclidean distance. We show that given a set S of n points with integer coordinates in the plane and a rational dilation delta > 1, it is NP-hard to determine whether a spanning tree of S with dilation at most A exists. (c) 2007 Elsevier B.V. All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2008-11
Language
ENG
Article Type
Article
Keywords

PLANAR GRAPHS; SPANNERS

Citation

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.41, no.3, pp.188 - 205

ISSN
0925-7721
DOI
10.1016/j.comgeo.2007.12.001
URI
http://hdl.handle.net/10203/7724
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
000259133100005.pdf(259.23 kB)Download
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 10 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0