Matches in SemOpenAlex for { <https://semopenalex.org/work/W4300703390> ?p ?o ?g. }
Showing items 1 to 67 of
67
with 100 items per page.
- W4300703390 abstract "Let F be a finite set of graphs. In the F-Deletion problem, we are given an n-vertex graph G and an integer k as input, and asked whether at most k vertices can be deleted from G such that the resulting graph does not contain a graph from F as a minor. F-Deletion is a generic problem and by selecting different sets of forbidden minors F, one can obtain various fundamental problems such as Vertex Cover, Feedback Vertex Set or Treewidth t-Deletion. In this paper we obtain a number of generic algorithmic results about Planar F-Deletion, when F contains at least one planar graph. The highlights of our work are - A constant factor approximation algorithm for the optimization version of Planar F-Deletion. - A randomized linear time and single exponential parameterized algorithm, that is, an algorithm running in time O(2^{O(k)} n), for the parameterized version of Planar F-deletion where all graphs in F are connected. The algorithm can be made deterministic at the cost of making the polynomial factor in the running time n*log^2 n rather than linear. - A polynomial kernel for parameterized Planar F-deletion These algorithms unify, generalize, and improve a multitude of results in the literature. Our main results have several direct applications, but also the methods we develop on the way have applicability beyond the scope of this paper. Our results -- constant factor approximation, polynomial kernelization and FPT algorithms -- are stringed together by a common theme of polynomial time preprocessing." @default.
- W4300703390 created "2022-10-04" @default.
- W4300703390 creator A5015806060 @default.
- W4300703390 creator A5038531405 @default.
- W4300703390 creator A5069283977 @default.
- W4300703390 creator A5075328697 @default.
- W4300703390 date "2012-04-18" @default.
- W4300703390 modified "2023-09-30" @default.
- W4300703390 title "Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms" @default.
- W4300703390 doi "https://doi.org/10.48550/arxiv.1204.4230" @default.
- W4300703390 hasPublicationYear "2012" @default.
- W4300703390 type Work @default.
- W4300703390 citedByCount "0" @default.
- W4300703390 crossrefType "posted-content" @default.
- W4300703390 hasAuthorship W4300703390A5015806060 @default.
- W4300703390 hasAuthorship W4300703390A5038531405 @default.
- W4300703390 hasAuthorship W4300703390A5069283977 @default.
- W4300703390 hasAuthorship W4300703390A5075328697 @default.
- W4300703390 hasBestOaLocation W43007033901 @default.
- W4300703390 hasConcept C101837359 @default.
- W4300703390 hasConcept C11413529 @default.
- W4300703390 hasConcept C114614502 @default.
- W4300703390 hasConcept C118615104 @default.
- W4300703390 hasConcept C132525143 @default.
- W4300703390 hasConcept C132569581 @default.
- W4300703390 hasConcept C165464430 @default.
- W4300703390 hasConcept C203776342 @default.
- W4300703390 hasConcept C207225210 @default.
- W4300703390 hasConcept C28723256 @default.
- W4300703390 hasConcept C311688 @default.
- W4300703390 hasConcept C33923547 @default.
- W4300703390 hasConcept C40687702 @default.
- W4300703390 hasConcept C43517604 @default.
- W4300703390 hasConcept C71017364 @default.
- W4300703390 hasConcept C80899671 @default.
- W4300703390 hasConceptScore W4300703390C101837359 @default.
- W4300703390 hasConceptScore W4300703390C11413529 @default.
- W4300703390 hasConceptScore W4300703390C114614502 @default.
- W4300703390 hasConceptScore W4300703390C118615104 @default.
- W4300703390 hasConceptScore W4300703390C132525143 @default.
- W4300703390 hasConceptScore W4300703390C132569581 @default.
- W4300703390 hasConceptScore W4300703390C165464430 @default.
- W4300703390 hasConceptScore W4300703390C203776342 @default.
- W4300703390 hasConceptScore W4300703390C207225210 @default.
- W4300703390 hasConceptScore W4300703390C28723256 @default.
- W4300703390 hasConceptScore W4300703390C311688 @default.
- W4300703390 hasConceptScore W4300703390C33923547 @default.
- W4300703390 hasConceptScore W4300703390C40687702 @default.
- W4300703390 hasConceptScore W4300703390C43517604 @default.
- W4300703390 hasConceptScore W4300703390C71017364 @default.
- W4300703390 hasConceptScore W4300703390C80899671 @default.
- W4300703390 hasLocation W43007033901 @default.
- W4300703390 hasOpenAccess W4300703390 @default.
- W4300703390 hasPrimaryLocation W43007033901 @default.
- W4300703390 hasRelatedWork W2043560626 @default.
- W4300703390 hasRelatedWork W2145388251 @default.
- W4300703390 hasRelatedWork W242849172 @default.
- W4300703390 hasRelatedWork W2948443822 @default.
- W4300703390 hasRelatedWork W3096349457 @default.
- W4300703390 hasRelatedWork W4210558012 @default.
- W4300703390 hasRelatedWork W4288361500 @default.
- W4300703390 hasRelatedWork W4291269320 @default.
- W4300703390 hasRelatedWork W4300703390 @default.
- W4300703390 hasRelatedWork W3184968052 @default.
- W4300703390 isParatext "false" @default.
- W4300703390 isRetracted "false" @default.
- W4300703390 workType "article" @default.