MPI-INF Logo
Publications

Server    domino.mpi-inf.mpg.de

Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop

Author, Editor
Author(s):
Fomin, Fedor V.
Philip, Geevarghese
Villanger, Yngve		dblp
dblp
dblp
Not MPG Author(s):
Fomin, Fedor V.
Villanger, Yngve
Editor(s):
Chakraborty, Supratik
Kumar, Amit		dblp
dblp
Not MPII Editor(s):
Chakraborty, Supratik
Kumar, Amit
BibTeX cite key*:
FominPhilipVillanger2011
Title, Booktitle
Title*:
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
fillin.pdf (562.85 KB)
Booktitle*:
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India
Event, URLs
Conference URL::
http://www.fsttcs.org/archives/2011/
Downloading URL:
http://drops.dagstuhl.de/opus/volltexte/2011/3345/pdf/27.pdf
Event Address*:
Mumbai, India
Language:
English
Event Date*
(no longer used):
Organization:
Event Start Date:
12 December 2011
Event End Date:
14 December 2011
Publisher
Name*:
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
URL:
http://www.dagstuhl.de/
Address*:
Dagstuhl, Germany
Type:
Vol, No, Year, pp.
Series:
Leibniz International Proceedings in Informatics
Volume:
13
Number:
Month:
Pages:
164-175
Year*:
2011
VG Wort Pages:
ISBN/ISSN:
978-3-939897-34-7
Sequence Number:
DOI:
10.4230/LIPIcs.FSTTCS.2011.164
Note, Abstract, ©
(LaTeX) Abstract:
The \textsc{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
$O(k^{3/2})$ 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 $O(\log{k})$ on planar graphs and
$O(\sqrt{k}\log{k})$ on $H$-minor-free graphs. These results
significantly improve the previously known kernelization and
approximation results for \textsc{Minimum Fill-in} on sparse
graphs.
URL for the Abstract:
http://drops.dagstuhl.de/opus/volltexte/2011/3345/
Keywords:
Minimum Fill-In, Approximation, Kernelization, Sparse graphs
Download
Access Level:
Public

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Algorithms and Complexity Group
Audience:
experts only
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{FominPhilipVillanger2011,
AUTHOR = {Fomin, Fedor V. and Philip, Geevarghese and Villanger, Yngve},
 EDITOR = {Chakraborty, Supratik and Kumar, Amit},
 TITLE = {Minimum Fill-in of Sparse Graphs: Kernelization and Approximation},
 BOOKTITLE = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India},
 PUBLISHER = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
 YEAR = {2011},
 VOLUME = {13},
 PAGES = {164--175},
 SERIES = {Leibniz International Proceedings in Informatics},
 ADDRESS = {Mumbai, India},
 ISBN = {978-3-939897-34-7},
 DOI = {10.4230/LIPIcs.FSTTCS.2011.164},
}

Entry last modified by Geevarghese Philip, 07/08/2014
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
[Library]		Created
04/22/2012 02:30:36 PM
Revision
1.
0.


Editor
Geevarghese Philip
Geevarghese Philip


Edit Date
12/08/2012 04:42:27 AM
04/22/2012 02:30:37 PM


File Attachment Icon
fillin.pdf