MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Dilation of Geometric Networks." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

4 documents found, showing 1 through 4.

ATOM

Minimum-dilation tour (and path) is NP-hard
by Panos Giannopoulos, Christian Knauer, Dániel Marx — 2007 — In EWCG ’07: Proceedings of the 23rd European Workshop on Computational Geometry
… degree. Constructing low-cost geometric networks of small dilation, as alternatives to the ‘expensive…
Cited by 1 (1 self) – Add To MetaCart

Computing geometric minimum-dilation graphs is NP-hard
by Rolf Klein, Martin Kutz — 2006 — In Proc. of Graph Drawing
…. Keywords: dilation, geometric network, plane graph, spanning ratio, stretch factor, NP-hardness 1…
Cited by 4 (0 self) – Add To MetaCart

Embedding Point Sets into Plane Graphs of Small Dilation
by Annette Ebbers-Baumann, Ansgar Grüne, Marek Karpinski, Rolf Klein, Christian Knauer, Andrzej Lingas — 2005 — In Algorithms and Computation: 16th International Symposium, ISAAC 2005, volume 3827 of Lecture Notes Comput. Sci
… position. Then the vertex set of P has dilation ≥ 2/ √ 3 ≈ 1.1547. Keywords: Dilation, geometric network…
Cited by 1 (1 self) – Add To MetaCart

The Density of Iterated Crossing Points and a Gap Result for Triangulations of Finite Point Sets
by Rolf Klein, Martin Kutz — 2005
…, geometric network, complete graph, lower bound, plane graph, spanning ratio, stretch factor, triangulation…
Cited by 2 (1 self) – Add To MetaCart

Showing 1 through 4.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB