Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
{"title":"Polynomial Kernel for Interval Vertex Deletion","authors":"Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi","doi":"https://dl.acm.org/doi/10.1145/3571075","DOIUrl":null,"url":null,"abstract":"<p>Given a graph <i>G</i> and an integer <i>k</i>, the <span>Interval Vertex Deletion (IVD)</span> problem asks whether there exists a subset <i>S</i>⊆<i>V</i>(<i>G</i>) of size at most <i>k</i> such that <i>G</i> − <i>S</i> is an interval graph. This problem is known to be <sans-serif>NP</sans-serif>-complete [Yannakakis, STOC’78]. Originally in 2012, Cao and Marx showed that <span>IVD</span> is fixed parameter tractable: they exhibited an algorithm with running time \\(10^k n^{\\mathcal {O}(1)} \\) [Cao and Marx, SODA’14]. The existence of a polynomial kernel for <span>IVD</span> remained a well-known open problem in Parameterized Complexity. In this paper, we settle this problem in the affirmative.</p>","PeriodicalId":50922,"journal":{"name":"ACM Transactions on Algorithms","volume":"1 5","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2023-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Algorithms","FirstCategoryId":"94","ListUrlMain":"https://doi.org/https://dl.acm.org/doi/10.1145/3571075","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
Given a graph G and an integer k, the Interval Vertex Deletion (IVD) problem asks whether there exists a subset S⊆V(G) of size at most k such that G − S is an interval graph. This problem is known to be NP-complete [Yannakakis, STOC’78]. Originally in 2012, Cao and Marx showed that IVD is fixed parameter tractable: they exhibited an algorithm with running time \(10^k n^{\mathcal {O}(1)} \) [Cao and Marx, SODA’14]. The existence of a polynomial kernel for IVD remained a well-known open problem in Parameterized Complexity. In this paper, we settle this problem in the affirmative.
期刊介绍：
ACM Transactions on Algorithms welcomes submissions of original research of the highest quality dealing with algorithms that are inherently discrete and finite, and having mathematical content in a natural way, either in the objective or in the analysis. Most welcome are new algorithms and data structures, new and improved analyses, and complexity results. Specific areas of computation covered by the journal include
combinatorial searches and objects;
counting;
discrete optimization and approximation;
randomization and quantum computation;
parallel and distributed computation;
algorithms for
graphs,
geometry,
arithmetic,
number theory,
strings;
on-line analysis;
cryptography;
coding;
data compression;
learning algorithms;
methods of algorithmic analysis;
discrete algorithms for application areas such as
biology,
economics,
game theory,
communication,
computer systems and architecture,
hardware design,
scientific computing
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
