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

Bücker, H. Martin ; Lülfesmann, Michael ; Rasch, Arno

Assessing an approximation algorithm for the minimum fill-in problem in practice

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


Abstract

We investigate an implementation of an approximation algorithm for the minimum fill-in problem. The algorithm has some degree of freedom since it is composed of several subtasks for which one can choose between different algorithms. The goal of the present work is to study the impact of theses components and carefully examine the practicability of the overall approximation algorithm by a set of numerical examples.

BibTeX - Entry

@InProceedings{bcker_et_al:DSP:2009:2119,
  author =	{H. Martin B{\"u}cker and Michael L{\"u}lfesmann and Arno Rasch},
  title =	{Assessing an approximation algorithm for the minimum fill-in problem in practice},
  booktitle =	{Combinatorial Scientific Computing},
  year =	{2009},
  editor =	{Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
  number =	{09061},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2119},
  annote =	{Keywords: Sparse linear algebra}
}

Keywords: Sparse linear algebra
Seminar: 09061 - Combinatorial Scientific Computing
Issue date: 2009
Date of publication: 30.07.2009


DROPS-Home | Fulltext Search | Imprint Published by LZI