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{bucker_et_al:DagSemProc.09061.5,
author = {B\"{u}cker, H. Martin and L\"{u}lfesmann, Michael and Rasch, Arno},
title = {{Assessing an approximation algorithm for the minimum fill-in problem in practice}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--1},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2009/2119},
URN = {urn:nbn:de:0030-drops-21191},
doi = {10.4230/DagSemProc.09061.5},
annote = {Keywords: Sparse linear algebra}
}
|
Keywords: |
|
Sparse linear algebra |
|
Collection: |
|
09061 - Combinatorial Scientific Computing |
|
Issue Date: |
|
2009 |
|
Date of publication: |
|
30.07.2009 |
Creative Commons Attribution 4.0 International license (CC BY 4.0)