Matches in SemOpenAlex for { <https://semopenalex.org/work/W2047916710> ?p ?o ?g. }
Showing items 1 to 81 of
81
with 100 items per page.
- W2047916710 endingPage "818" @default.
- W2047916710 startingPage "814" @default.
- W2047916710 abstract "Partial Cover problems are optimization versions of fundamental and well-studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) the maximum number of edges (or vertices) using a given number k of vertices, rather than covering all edges (or vertices). In general graphs, these problems are hard for parameterized complexity classes when parameterized by k. It was recently shown by Amini et al. (2008) [1] that Partial Vertex Cover and Partial Dominating Set are fixed parameter tractable on large classes of sparse graphs, namely H-minor-free graphs, which include planar graphs and graphs of bounded genus. In particular, it was shown that on planar graphs both problems can be solved in time 2^O^(^k^)n^O^(^1^). During the last decade there has been an extensive study on parameterized subexponential algorithms. In particular, it was shown that the classical Vertex Cover and Dominating Set problems can be solved in subexponential time on H-minor-free graphs. The techniques developed to obtain subexponential algorithms for classical problems do not apply to partial cover problems. It was left as an open problem by Amini et al. (2008) [1] whether there is a subexponential algorithm for Partial Vertex Cover and Partial Dominating Set. In this paper, we answer the question affirmatively by solving both problems in time 2^O^(^k^)n^O^(^1^) not only on planar graphs but also on much larger classes of graphs, namely, apex-minor-free graphs. Compared to previously known algorithms for these problems our algorithms are significantly faster and simpler." @default.
- W2047916710 created "2016-06-24" @default.
- W2047916710 creator A5015806060 @default.
- W2047916710 creator A5038531405 @default.
- W2047916710 creator A5073311967 @default.
- W2047916710 creator A5075328697 @default.
- W2047916710 date "2011-08-01" @default.
- W2047916710 modified "2023-09-27" @default.
- W2047916710 title "Subexponential algorithms for partial cover problems" @default.
- W2047916710 cites W1976463682 @default.
- W2047916710 cites W2005079828 @default.
- W2047916710 cites W2012313040 @default.
- W2047916710 cites W2015706819 @default.
- W2047916710 cites W2021156120 @default.
- W2047916710 cites W2073689249 @default.
- W2047916710 cites W2085348754 @default.
- W2047916710 cites W2127485201 @default.
- W2047916710 cites W2156896570 @default.
- W2047916710 cites W2158584754 @default.
- W2047916710 cites W4241253564 @default.
- W2047916710 cites W4256621010 @default.
- W2047916710 doi "https://doi.org/10.1016/j.ipl.2011.05.016" @default.
- W2047916710 hasPublicationYear "2011" @default.
- W2047916710 type Work @default.
- W2047916710 sameAs 2047916710 @default.
- W2047916710 citedByCount "33" @default.
- W2047916710 countsByYear W20479167102012 @default.
- W2047916710 countsByYear W20479167102013 @default.
- W2047916710 countsByYear W20479167102014 @default.
- W2047916710 countsByYear W20479167102015 @default.
- W2047916710 countsByYear W20479167102016 @default.
- W2047916710 countsByYear W20479167102018 @default.
- W2047916710 countsByYear W20479167102019 @default.
- W2047916710 countsByYear W20479167102020 @default.
- W2047916710 countsByYear W20479167102021 @default.
- W2047916710 countsByYear W20479167102022 @default.
- W2047916710 countsByYear W20479167102023 @default.
- W2047916710 crossrefType "journal-article" @default.
- W2047916710 hasAuthorship W2047916710A5015806060 @default.
- W2047916710 hasAuthorship W2047916710A5038531405 @default.
- W2047916710 hasAuthorship W2047916710A5073311967 @default.
- W2047916710 hasAuthorship W2047916710A5075328697 @default.
- W2047916710 hasBestOaLocation W20479167102 @default.
- W2047916710 hasConcept C11413529 @default.
- W2047916710 hasConcept C127413603 @default.
- W2047916710 hasConcept C2780428219 @default.
- W2047916710 hasConcept C33923547 @default.
- W2047916710 hasConcept C41008148 @default.
- W2047916710 hasConcept C78519656 @default.
- W2047916710 hasConcept C80444323 @default.
- W2047916710 hasConceptScore W2047916710C11413529 @default.
- W2047916710 hasConceptScore W2047916710C127413603 @default.
- W2047916710 hasConceptScore W2047916710C2780428219 @default.
- W2047916710 hasConceptScore W2047916710C33923547 @default.
- W2047916710 hasConceptScore W2047916710C41008148 @default.
- W2047916710 hasConceptScore W2047916710C78519656 @default.
- W2047916710 hasConceptScore W2047916710C80444323 @default.
- W2047916710 hasIssue "16" @default.
- W2047916710 hasLocation W20479167101 @default.
- W2047916710 hasLocation W20479167102 @default.
- W2047916710 hasLocation W20479167103 @default.
- W2047916710 hasLocation W20479167104 @default.
- W2047916710 hasOpenAccess W2047916710 @default.
- W2047916710 hasPrimaryLocation W20479167101 @default.
- W2047916710 hasRelatedWork W1572243069 @default.
- W2047916710 hasRelatedWork W2019622288 @default.
- W2047916710 hasRelatedWork W2144970024 @default.
- W2047916710 hasRelatedWork W2333698505 @default.
- W2047916710 hasRelatedWork W2351491280 @default.
- W2047916710 hasRelatedWork W2364499468 @default.
- W2047916710 hasRelatedWork W2371447506 @default.
- W2047916710 hasRelatedWork W2386767533 @default.
- W2047916710 hasRelatedWork W2392953011 @default.
- W2047916710 hasRelatedWork W303980170 @default.
- W2047916710 hasVolume "111" @default.
- W2047916710 isParatext "false" @default.
- W2047916710 isRetracted "false" @default.
- W2047916710 magId "2047916710" @default.
- W2047916710 workType "article" @default.