Greedy Geometric Spanner
   HOME
*



picture info

Greedy Geometric Spanner
In computational geometry, a greedy geometric spanner is an undirected graph whose distances approximate the Euclidean distances among a finite set of points in a Euclidean space. The vertices of the graph represent these points. The edges of the spanner are selected by a greedy algorithm that includes an edge whenever its two endpoints are not connected by a short path of shorter edges. The greedy spanner was first described in the PhD thesis of Gautam Das (computer scientist), Gautam Das and conference paper and subsequent journal paper by Ingo Althöfer et al. These sources also credited Marshall Bern (unpublished) with the independent discovery of the same construction. Greedy geometric spanners have bounded degree (graph theory), degree, a linear total number of edges, and total weight close to that of the Euclidean minimum spanning tree. Although known construction methods for them are slow, fast approximation algorithms with similar properties are known. Construction The gr ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Greedy Geometric Spanner 2
Greedy may refer to: __NOTOC__ Music * Greedy (album), ''Greedy'' (album), a 1997 album by Headless Chickens * Greedy (song), "Greedy" (song), a song on the album ''Dangerous Woman'' by Ariana Grande * "Greedy", a single by Canadian rock band Pure (Canadian band), Pure * "Greedy", a song on the album ''Mass Nerder'' by the punk rock band All * "Greedy", a song on the album ''Lyfe 268‒192'' by Lyfe Jennings * "Greedy", a song on the album ''Training Day (album), Training Day'' by The Away Team * "Greedy", a song on the mixtape ''Keep Flexin'' by Rich the Kid People * Greedy Smith (1956–2019), pseudonym of Andrew McArthur Smith, singer, musician and songwriter with the Australian pop/new wave band Mental As Anything * Greedy Williams (born 1997), American football player nicknamed "Greedy" * Jack Greedy (1929–1988), Canadian racing driver, member of the Canadian Motorsport Hall of Fame Other uses * Greedy algorithm, any algorithm that follows the problem-solving heuristic of maki ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Geometric Spanner
A geometric spanner or a -spanner graph or a -spanner was initially introduced as a weighted graph over a set of points as its vertices for which there is a -path between any pair of vertices for a fixed parameter . A -path is defined as a path through the graph with weight at most times the spatial distance between its endpoints. The parameter is called the stretch factor or dilation factor of the spanner. In computational geometry, the concept was first discussed by L.P. Chew in 1986, although the term "spanner" was not used in the original paper. The notion of graph spanners has been known in graph theory: -spanners are spanning subgraphs of graphs with similar dilation property, where distances between graph vertices are defined in graph-theoretical terms. Therefore geometric spanners are graph spanners of complete graphs embedded in the plane with edge weights equal to the distances between the embedded vertices in the corresponding metric. Spanners may be used in ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


SIAM Journal On Computing
The ''SIAM Journal on Computing'' is a scientific journal focusing on the mathematical and formal aspects of computer science. It is published by the Society for Industrial and Applied Mathematics (SIAM). Although its official ISO abbreviation is ''SIAM J. Comput.'', its publisher and contributors frequently use the shorter abbreviation ''SICOMP''. SICOMP typically hosts the special issues of the IEEE Annual Symposium on Foundations of Computer Science (FOCS) and the Annual ACM Symposium on Theory of Computing (STOC), where about 15% of papers published in FOCS and STOC each year are invited to these special issues. For example, Volume 48 contains 11 out of 85 papers published in FOCS 2016. References * External linksSIAM Journal on Computing
on


MORE