License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-1566
URL: http://drops.dagstuhl.de/opus/volltexte/2005/156/

Gudmundsson, Joachim ; Vahrenhold, Jan

A Simple Algorithm for I/O-efficiently Pruning Dense Spanners

pdf-format:
Dokument 1.pdf (172 KB)


Abstract

Given a geometric graph $G=(S,E)$ in $R^d$ with constant dilation $t$, and a positive constant $\epsilon$, we show how to construct a $(1+\epsilon)$-spanner of $G$ with $O(|S|)$ edges using $O(sort(|E|))$ I/O operations.

BibTeX - Entry

@InProceedings{gudmundsson_et_al:DSP:2005:156,
  author =	{Joachim Gudmundsson and Jan Vahrenhold},
  title =	{A Simple Algorithm for I/O-efficiently Pruning Dense Spanners},
  booktitle =	{Cache-Oblivious and Cache-Aware Algorithms},
  year =	{2005},
  editor =	{Lars Arge and Michael A. Bender and Erik Demaine and Charles Leiserson and Kurt Mehlhorn},
  number =	{04301},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2005/156},
  annote =	{Keywords: No keywords}
}

Keywords: No keywords
Seminar: 04301 - Cache-Oblivious and Cache-Aware Algorithms
Issue date: 2005
Date of publication: 01.07.2005


DROPS-Home | Fulltext Search | Imprint Published by LZI