Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies

Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (2010)

Cached

Download Links

[gudmundsson.biz]

by Fabian Gieseke, et al.

BibTeX

@MISC{Gieseke10pruningspanners,
    author = {Fabian Gieseke and et al.},
    title = {Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies },
    year = {2010}
}

Bookmark

OpenURL

Abstract

Citations

7321	Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
494	The input/output complexity of sorting and related problems. Commun - AGGARWAL, VITTER - 1988
214	A decomposition of multidimensional point sets with application to k-nearest-neighbors and n-body potential fields - Callahan, Kosaraju - 1995
90	Euclidean spanners: short, thin, and lanky - Arya, Das, et al. - 1995
78	External memory data structures - Arge - 2002
71	New sparseness results on graph spanners - Chandra, Das, et al. - 1995
63	Geometric Spanner Networks - Narasimhan, Smid - 2007
60	Closest point problems in computational geometry, in - Smid
50	A fast algorithm for constructing sparse Euclidean spanners - Das, Narasimhan - 1994
50	Geometric spanners for wireless ad hoc networks - ALZOUBI, LI, et al. - 2002
46	The buffer tree: A technique for designing batched external data structures - Arge
44	A data structure for dynamically maintaining rooted trees - Frederickson - 1997
42	Algorithms and data structures for external memory - Vitter - 2006
37	Cache oblivious distribution sweeping - Brodal, Fagerberg - 2002
30	On sparse spanners of weighted graphs, Discrete and Computational Geometry 9 - Althofer, Das, et al. - 1993
30	Funnel heap - a cache oblivious priority queue - Brodal, Fagerberg
29	Approximate distance oracles for geometric graphs - Gudmundsson, Levcopoulos, et al. - 2002
28	Dealing with higher dimensions: the well-separated pair decomposition and its applications - Callahan - 1995
18	Lower bounds for computing geometric spanners and approximate shortest paths, Discrete Applied Mathematics 110 - Chen, Das, et al. - 2001
12	t-spanners as a data structure for metric space searching - Navarro, Paredes, et al. - 2002
12	I/O-efficient algorithms for shortest path related problems - Zeh - 2002
10	Practical construction of metric t-spanners - Navarro, Paredes - 2003
10	Improved greedy algorithms for constructing sparse geometric spanners - Gudmundsson, Levcopoulos, et al. - 2002
8	Elementary graph algorithms in external memory - Katriel, Meyer - 2003
8	I/O-efficient well-separated pair decomposition and its applications, Algorithmica 45 (4 - Govindarajan, Lukovszki, et al. - 2006
7	Dilation and detours in geometric networks, in: T - Gudmundsson, Knauer
5	Applications of computational geometry in wireless ad hoc networks, in - Li
4	I/O-efficient batched range counting and its applications to proximity problems - Lukovszki, Maheshwari, et al. - 2001
3	Spanning trees and spanners, in: J.-R - Eppstein
2	I/O-efficient shortest path queries in geometric spanners - Maheshwari, Smid, et al. - 2001
2	An optimal cache-oblivious priority queue and its application to graph algorithms - Arge, Bender, et al. - 2007
1	I/O-efficiently pruning dense spanners, in - Gudmundsson, Vahrenhold - 2005
1	Geometric spanners, in: M.-Y. Kao (Ed.), Encyclopedia of Algorithms - Gudmundsson, Narasimhan, et al. - 2008
1	Maintaining hierarchical graph views, in: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, Association for Computing Machinery - Buchsbaum, Westbrook - 2000
1	I/O-efficient algorithms for sparse graphs - Toma, Zeh - 2003
1	Algorithmen zur Konstruktion und Ausdünnung von Spanner-Graphen im Cache-ObliviousModell - Gieseke - 2007