Change search
ReferencesLink to record
Permanent link

Direct link
A kernel of order 2k-c log k for vertex cover
City University of New York.
2011 (English)In: Information Processing Letters, ISSN 0020-0190, E-ISSN 1872-6119, Vol. 111, no 23-24, 1089-1091 p.Article in journal (Refereed) Published
Abstract [en]

In a recent paper Soleimanfallah and Yeo proposed a kernelization algorithm for vertex cover which, for any fixed constant c, produces a kernel of order 2k - c in polynomial time. In this paper we show how their techniques can be extended to improve the produced kernel to order 2k - c log k, for any fixed constant c.

Place, publisher, year, edition, pages
2011. Vol. 111, no 23-24, 1089-1091 p.
Keyword [en]
Graph algorithms, Parameterized complexity, Kernelization algorithm, Vertex cover
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-58598DOI: 10.1016/j.ipl.2011.09.003ISI: 000296990500003OAI: diva2:473404
QC 20120110Available from: 2012-01-05 Created: 2012-01-05 Last updated: 2012-01-10Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Lampis, Michael
In the same journal
Information Processing Letters
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 16 hits
ReferencesLink to record
Permanent link

Direct link