FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2000311286> ?p ?o ?g. }

• W2000311286 abstract "The existence of a polynomial kernel for Odd Cycle Transversal was a notorious open problem in parameterized complexity. Recently, this was settled by the present authors (Kratsch and Wahlstrom, SODA 2012), with a randomized polynomial kernel for the problem, using matroid theory to encode How questions over a set of terminals in size polynomial in the number of terminals (rather than the total graph size, which may be superpolynomially larger). In the current work we further establish the usefulness of matroid theory to kernelization by showing applications of a result on representative sets due to Lovasz (Combinatorial Surveys 1977) and Marx (TCS 2009). We show how representative sets can be used to give a polynomial kernel for the elusive Almost 2-sat problem (where the task is to remove at most k clauses to make a 2-CNF formula satisfiable), solving a major open problem in kernelization. We further apply the representative sets tool to the problem of finding irrelevant vertices in graph cut problems, that is, vertices which can be made undeletable without affecting the status of the problem. This gives the first significant progress towards a polynomial kernel for the Multiway Cut problem; in particular, we get a polynomial kernel for Multiway Cut instances with a bounded number of terminals. Both these kernelization results have significant spin-off effects, producing the first polynomial kernels for a range of related problems. More generally, the irrelevant vertex results have implications for covering min-cuts in graphs. In particular, given a directed graph and a set of terminals, we can find a set of size polynomial in the number of terminals (a cut-covering set) which contains a minimum vertex cut for every choice of sources and sinks from the terminal set. Similarly, given an undirected graph and a set of terminals, we can find a set of vertices, of size polynomial in the number of terminals, which contains a minimum multiway cut for every partition of the terminals into a bounded number of sets. Both results are polynomial time. We expect this to have further applications; in particular, we get direct, reduction rule-based kernelizations for all problems above, in contrast to the indirect compression-based kernel previously given for Odd Cycle Transversal. All our results are randomized, with failure probabilities which can be made exponentially small in the size of the input, due to needing a representation of a matroid to apply the representative sets tool." @default.
• W2000311286 created "2016-06-24" @default.
• W2000311286 creator A5001475076 @default.
• W2000311286 creator A5050140825 @default.
• W2000311286 date "2012-10-01" @default.
• W2000311286 modified "2023-09-23" @default.
• W2000311286 title "Representative Sets and Irrelevant Vertices: New Tools for Kernelization" @default.
• W2000311286 cites W1485150579 @default.
• W2000311286 cites W1517036688 @default.
• W2000311286 cites W1553642186 @default.
• W2000311286 cites W1689320375 @default.
• W2000311286 cites W184144034 @default.
• W2000311286 cites W1972514464 @default.
• W2000311286 cites W1976430052 @default.
• W2000311286 cites W1987580556 @default.
• W2000311286 cites W1994520092 @default.
• W2000311286 cites W1998964055 @default.
• W2000311286 cites W2005079828 @default.
• W2000311286 cites W2012776084 @default.
• W2000311286 cites W2025304499 @default.
• W2000311286 cites W2034377062 @default.
• W2000311286 cites W203718333 @default.
• W2000311286 cites W2037963188 @default.
• W2000311286 cites W2051856222 @default.
• W2000311286 cites W2058258808 @default.
• W2000311286 cites W2058264792 @default.
• W2000311286 cites W2085312445 @default.
• W2000311286 cites W2091434162 @default.
• W2000311286 cites W2106959995 @default.
• W2000311286 cites W2107284348 @default.
• W2000311286 cites W2115448953 @default.
• W2000311286 cites W2121641644 @default.
• W2000311286 cites W2127114399 @default.
• W2000311286 cites W2134628243 @default.
• W2000311286 cites W2150187954 @default.
• W2000311286 cites W2153916899 @default.
• W2000311286 cites W2295651994 @default.
• W2000311286 cites W2952965238 @default.
• W2000311286 cites W3098486139 @default.
• W2000311286 cites W4231868828 @default.
• W2000311286 cites W4242357733 @default.
• W2000311286 cites W87291490 @default.
• W2000311286 doi "https://doi.org/10.1109/focs.2012.46" @default.
• W2000311286 hasPublicationYear "2012" @default.
• W2000311286 type Work @default.
• W2000311286 sameAs 2000311286 @default.
• W2000311286 citedByCount "107" @default.
• W2000311286 countsByYear W20003112862012 @default.
• W2000311286 countsByYear W20003112862013 @default.
• W2000311286 countsByYear W20003112862014 @default.
• W2000311286 countsByYear W20003112862015 @default.
• W2000311286 countsByYear W20003112862016 @default.
• W2000311286 countsByYear W20003112862017 @default.
• W2000311286 countsByYear W20003112862018 @default.
• W2000311286 countsByYear W20003112862019 @default.
• W2000311286 countsByYear W20003112862020 @default.
• W2000311286 countsByYear W20003112862021 @default.
• W2000311286 countsByYear W20003112862022 @default.
• W2000311286 countsByYear W20003112862023 @default.
• W2000311286 crossrefType "proceedings-article" @default.
• W2000311286 hasAuthorship W2000311286A5001475076 @default.
• W2000311286 hasAuthorship W2000311286A5050140825 @default.
• W2000311286 hasBestOaLocation W20003112862 @default.
• W2000311286 hasConcept C106286213 @default.
• W2000311286 hasConcept C114614502 @default.
• W2000311286 hasConcept C118615104 @default.
• W2000311286 hasConcept C122280245 @default.
• W2000311286 hasConcept C12267149 @default.
• W2000311286 hasConcept C132525143 @default.
• W2000311286 hasConcept C134306372 @default.
• W2000311286 hasConcept C154945302 @default.
• W2000311286 hasConcept C160446489 @default.
• W2000311286 hasConcept C165464430 @default.
• W2000311286 hasConcept C207225210 @default.
• W2000311286 hasConcept C311688 @default.
• W2000311286 hasConcept C33923547 @default.
• W2000311286 hasConcept C34388435 @default.
• W2000311286 hasConcept C41008148 @default.
• W2000311286 hasConcept C80899671 @default.
• W2000311286 hasConceptScore W2000311286C106286213 @default.
• W2000311286 hasConceptScore W2000311286C114614502 @default.
• W2000311286 hasConceptScore W2000311286C118615104 @default.
• W2000311286 hasConceptScore W2000311286C122280245 @default.
• W2000311286 hasConceptScore W2000311286C12267149 @default.
• W2000311286 hasConceptScore W2000311286C132525143 @default.
• W2000311286 hasConceptScore W2000311286C134306372 @default.
• W2000311286 hasConceptScore W2000311286C154945302 @default.
• W2000311286 hasConceptScore W2000311286C160446489 @default.
• W2000311286 hasConceptScore W2000311286C165464430 @default.
• W2000311286 hasConceptScore W2000311286C207225210 @default.
• W2000311286 hasConceptScore W2000311286C311688 @default.
• W2000311286 hasConceptScore W2000311286C33923547 @default.
• W2000311286 hasConceptScore W2000311286C34388435 @default.
• W2000311286 hasConceptScore W2000311286C41008148 @default.
• W2000311286 hasConceptScore W2000311286C80899671 @default.
• W2000311286 hasLocation W20003112861 @default.
• W2000311286 hasLocation W20003112862 @default.
• W2000311286 hasOpenAccess W2000311286 @default.
• W2000311286 hasPrimaryLocation W20003112861 @default.
• W2000311286 hasRelatedWork W1876800908 @default.

• next