FRINK Linked Data Fragments server

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

• W2963179814 abstract "We give a new general approach for designing exact exponential-time algorithms for subset problems. In a subset problem the input implicitly describes a family of sets over a universe of size n and the task is to determine whether the family contains at least one set. A typical example of a subset problem is Weighted d-SAT. Here, the input is a CNF-formula with clauses of size at most d, and an integer W. The universe is the set of variables and the variables have integer weights. The family contains all the subsets S of variables such that the total weight of the variables in S does not exceed W, and setting the variables in S to 1 and the remaining variables to 0 satisfies the formula. Our approach is based on “monotone local search”, where the goal is to extend a partial solution to a solution by adding as few elements as possible. More formally, in the extension problem we are also given as input a subset X of the universe and an integer k. The task is to determine whether one can add at most k elements to X to obtain a set in the (implicitly defined) family. Our main result is that a cknO(1) time algorithm for the extension problem immediately yields a randomized algorithm for finding a solution of any size with running time O((2−1/c)n). In many cases, the extension problem can be reduced to simply finding a solution of size at most k. Furthermore, efficient algorithms for finding small solutions have been extensively studied in the field of parameterized algorithms. Directly applying these algorithms, our theorem yields in one stroke significant improvements over the best known exponential-time algorithms for several well-studied problems, including d-Hitting Set, Feedback Vertex Set, Node Unique Label Cover, and Weighted d-SAT. Our results demonstrate an interesting and very concrete connection between parameterized algorithms and exact exponential-time algorithms. We also show how to derandomize our algorithms at the cost of a subexponential multiplicative factor in the running time. Our derandomization is based on an efficient construction of a new pseudo-random object that might be of independent interest. Finally, we extend our methods to establish new combinatorial upper bounds and develop enumeration algorithms." @default.
• W2963179814 created "2019-07-30" @default.
• W2963179814 creator A5015806060 @default.
• W2963179814 creator A5038531405 @default.
• W2963179814 creator A5048738368 @default.
• W2963179814 creator A5075328697 @default.
• W2963179814 date "2016-06-19" @default.
• W2963179814 modified "2023-09-29" @default.
• W2963179814 title "Exact algorithms via monotone local search" @default.
• W2963179814 cites W1561738351 @default.
• W2963179814 cites W1563108031 @default.
• W2963179814 cites W1586356312 @default.
• W2963179814 cites W1867877755 @default.
• W2963179814 cites W1964089073 @default.
• W2963179814 cites W1968041356 @default.
• W2963179814 cites W1971393213 @default.
• W2963179814 cites W1979312598 @default.
• W2963179814 cites W2026915697 @default.
• W2963179814 cites W2037963188 @default.
• W2963179814 cites W2040924621 @default.
• W2963179814 cites W2047470084 @default.
• W2963179814 cites W2053536525 @default.
• W2963179814 cites W2059273723 @default.
• W2963179814 cites W2084595628 @default.
• W2963179814 cites W2131274579 @default.
• W2963179814 cites W2157295389 @default.
• W2963179814 cites W2159177140 @default.
• W2963179814 cites W2165930352 @default.
• W2963179814 cites W2168704151 @default.
• W2963179814 cites W2171680292 @default.
• W2963179814 cites W2179374656 @default.
• W2963179814 cites W2205964593 @default.
• W2963179814 cites W2401114553 @default.
• W2963179814 cites W2570525280 @default.
• W2963179814 cites W2886475100 @default.
• W2963179814 cites W2962728077 @default.
• W2963179814 cites W2962973738 @default.
• W2963179814 cites W3101258912 @default.
• W2963179814 cites W4210756314 @default.
• W2963179814 doi "https://doi.org/10.1145/2897518.2897551" @default.
• W2963179814 hasPublicationYear "2016" @default.
• W2963179814 type Work @default.
• W2963179814 sameAs 2963179814 @default.
• W2963179814 citedByCount "24" @default.
• W2963179814 countsByYear W29631798142016 @default.
• W2963179814 countsByYear W29631798142017 @default.
• W2963179814 countsByYear W29631798142018 @default.
• W2963179814 countsByYear W29631798142019 @default.
• W2963179814 countsByYear W29631798142020 @default.
• W2963179814 countsByYear W29631798142021 @default.
• W2963179814 countsByYear W29631798142022 @default.
• W2963179814 crossrefType "proceedings-article" @default.
• W2963179814 hasAuthorship W2963179814A5015806060 @default.
• W2963179814 hasAuthorship W2963179814A5038531405 @default.
• W2963179814 hasAuthorship W2963179814A5048738368 @default.
• W2963179814 hasAuthorship W2963179814A5075328697 @default.
• W2963179814 hasBestOaLocation W29631798142 @default.
• W2963179814 hasConcept C11413529 @default.
• W2963179814 hasConcept C2524010 @default.
• W2963179814 hasConcept C2834757 @default.
• W2963179814 hasConcept C33923547 @default.
• W2963179814 hasConcept C41008148 @default.
• W2963179814 hasConceptScore W2963179814C11413529 @default.
• W2963179814 hasConceptScore W2963179814C2524010 @default.
• W2963179814 hasConceptScore W2963179814C2834757 @default.
• W2963179814 hasConceptScore W2963179814C33923547 @default.
• W2963179814 hasConceptScore W2963179814C41008148 @default.
• W2963179814 hasFunder F4320323898 @default.
• W2963179814 hasFunder F4320334678 @default.
• W2963179814 hasFunder F4320334704 @default.
• W2963179814 hasLocation W29631798141 @default.
• W2963179814 hasLocation W29631798142 @default.
• W2963179814 hasOpenAccess W2963179814 @default.
• W2963179814 hasPrimaryLocation W29631798141 @default.
• W2963179814 hasRelatedWork W2333698505 @default.
• W2963179814 hasRelatedWork W2351491280 @default.
• W2963179814 hasRelatedWork W2371447506 @default.
• W2963179814 hasRelatedWork W2378701539 @default.
• W2963179814 hasRelatedWork W2385556819 @default.
• W2963179814 hasRelatedWork W2386767533 @default.
• W2963179814 hasRelatedWork W2388499291 @default.
• W2963179814 hasRelatedWork W2889453578 @default.
• W2963179814 hasRelatedWork W303980170 @default.
• W2963179814 hasRelatedWork W3141679561 @default.
• W2963179814 isParatext "false" @default.
• W2963179814 isRetracted "false" @default.
• W2963179814 magId "2963179814" @default.
• W2963179814 workType "article" @default.