Minimum Fill-in of Sparse Graphs: Kernelization and Approximation

Fomin, Fedor V.; Philip, Geevarghese; Villanger, Yngve

doi:10.1007/s00453-013-9776-1

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

Minimum Fill-in of Sparse Graphs: Kernelization and Approximation

MPS-Authors

/persons/resource/persons71823

Philip, Geevarghese
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Fomin, F. V., Philip, G., & Villanger, Y. (2015). Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. Algorithmica, 71(1), 1-20. doi:10.1007/s00453-013-9776-1.

引用: https://hdl.handle.net/11858/00-001M-0000-0025-7592-A

要旨

The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. The problem has important applications in numerical algebra, in particular in sparse matrix computations. We develop kernelization algorithms for the problem on several classes of sparse graphs. We obtain linear kernels on planar graphs, and kernels of size in graphs excluding some fixed graph as a minor and in graphs of bounded degeneracy. As a byproduct of our results, we obtain approximation algorithms with approximation ratios on planar graphs and on H-minor-free graphs. These results significantly improve the previously known kernelization and approximation results for Minimum Fill-in on sparse graphs.