Matches in SemOpenAlex for { <https://semopenalex.org/work/W2952587811> ?p ?o ?g. }
Showing items 1 to 81 of
81
with 100 items per page.
- W2952587811 abstract "In the area of parameterized complexity, to cope with NP-Hard problems, we introduce a parameter k besides the input size n, and we aim to design algorithms (called FPT algorithms) that run in O(f(k)n^d) time for some function f(k) and constant d. Though FPT algorithms have been successfully designed for many problems, typically they are not sufficiently fast because of huge f(k) and d. In this paper, we give FPT algorithms with small f(k) and d for many important problems including Odd Cycle Transversal and Almost 2-SAT. More specifically, we can choose f(k) as a single exponential (4^k) and d as one, that is, linear in the input size. To the best of our knowledge, our algorithms achieve linear time complexity for the first time for these problems. To obtain our algorithms for these problems, we consider a large class of integer programs, called BIP2. Then we show that, in linear time, we can reduce BIP2 to Vertex Cover Above LP preserving the parameter k, and we can compute an optimal LP solution for Vertex Cover Above LP using network flow. Then, we perform an exhaustive search by fixing half-integral values in the optimal LP solution for Vertex Cover Above LP. A bottleneck here is that we need to recompute an LP optimal solution after branching. To address this issue, we exploit network flow to update the optimal LP solution in linear time." @default.
- W2952587811 created "2019-06-27" @default.
- W2952587811 creator A5034338968 @default.
- W2952587811 creator A5038701345 @default.
- W2952587811 creator A5079304908 @default.
- W2952587811 date "2013-12-18" @default.
- W2952587811 modified "2023-10-18" @default.
- W2952587811 title "Linear-Time FPT Algorithms via Network Flow" @default.
- W2952587811 cites W1517036688 @default.
- W2952587811 cites W1570425181 @default.
- W2952587811 cites W1991223992 @default.
- W2952587811 cites W1994788283 @default.
- W2952587811 cites W1996472240 @default.
- W2952587811 cites W2000311286 @default.
- W2952587811 cites W2005309613 @default.
- W2952587811 cites W2013415302 @default.
- W2952587811 cites W2020282424 @default.
- W2952587811 cites W2028357390 @default.
- W2952587811 cites W2046999257 @default.
- W2952587811 cites W2047577363 @default.
- W2952587811 cites W2051856222 @default.
- W2952587811 cites W2059372025 @default.
- W2952587811 cites W2086937160 @default.
- W2952587811 cites W2093128520 @default.
- W2952587811 cites W2913688336 @default.
- W2952587811 cites W2949203032 @default.
- W2952587811 cites W2949292523 @default.
- W2952587811 cites W2951506530 @default.
- W2952587811 doi "https://doi.org/10.1137/1.9781611973402.127" @default.
- W2952587811 hasPublicationYear "2013" @default.
- W2952587811 type Work @default.
- W2952587811 sameAs 2952587811 @default.
- W2952587811 citedByCount "22" @default.
- W2952587811 countsByYear W29525878112013 @default.
- W2952587811 countsByYear W29525878112014 @default.
- W2952587811 countsByYear W29525878112015 @default.
- W2952587811 countsByYear W29525878112016 @default.
- W2952587811 countsByYear W29525878112017 @default.
- W2952587811 countsByYear W29525878112018 @default.
- W2952587811 countsByYear W29525878112019 @default.
- W2952587811 countsByYear W29525878112020 @default.
- W2952587811 countsByYear W29525878112021 @default.
- W2952587811 countsByYear W29525878112022 @default.
- W2952587811 crossrefType "proceedings-article" @default.
- W2952587811 hasAuthorship W2952587811A5034338968 @default.
- W2952587811 hasAuthorship W2952587811A5038701345 @default.
- W2952587811 hasAuthorship W2952587811A5079304908 @default.
- W2952587811 hasBestOaLocation W29525878112 @default.
- W2952587811 hasConcept C11413529 @default.
- W2952587811 hasConcept C114809511 @default.
- W2952587811 hasConcept C126255220 @default.
- W2952587811 hasConcept C2524010 @default.
- W2952587811 hasConcept C33923547 @default.
- W2952587811 hasConcept C38349280 @default.
- W2952587811 hasConcept C41008148 @default.
- W2952587811 hasConceptScore W2952587811C11413529 @default.
- W2952587811 hasConceptScore W2952587811C114809511 @default.
- W2952587811 hasConceptScore W2952587811C126255220 @default.
- W2952587811 hasConceptScore W2952587811C2524010 @default.
- W2952587811 hasConceptScore W2952587811C33923547 @default.
- W2952587811 hasConceptScore W2952587811C38349280 @default.
- W2952587811 hasConceptScore W2952587811C41008148 @default.
- W2952587811 hasLocation W29525878111 @default.
- W2952587811 hasLocation W29525878112 @default.
- W2952587811 hasLocation W29525878113 @default.
- W2952587811 hasOpenAccess W2952587811 @default.
- W2952587811 hasPrimaryLocation W29525878111 @default.
- W2952587811 hasRelatedWork W2069541586 @default.
- W2952587811 hasRelatedWork W2270959725 @default.
- W2952587811 hasRelatedWork W2333698505 @default.
- W2952587811 hasRelatedWork W2351491280 @default.
- W2952587811 hasRelatedWork W2371447506 @default.
- W2952587811 hasRelatedWork W2375873432 @default.
- W2952587811 hasRelatedWork W2386767533 @default.
- W2952587811 hasRelatedWork W3000598246 @default.
- W2952587811 hasRelatedWork W303980170 @default.
- W2952587811 hasRelatedWork W3141113327 @default.
- W2952587811 isParatext "false" @default.
- W2952587811 isRetracted "false" @default.
- W2952587811 magId "2952587811" @default.
- W2952587811 workType "article" @default.