FRINK Linked Data Fragments server

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

• W561119072 abstract "Data reduction is a preprocessing technique which makes huge and seemingly intractable instances of a problem small and tractable. This technique is often acknowledged as one of the most powerful methods to cope with the intractability of certain NP-complete problems. Heuristics for reducing data can often be seen as reduction rules, if considered from a parameterized complexity viewpoint. Using reduction rules to transform the instances of a parameterized problem into equivalent instances, with size bounded by a function of the parameter, is known as kernelization. This thesis introduces and develops an approach to designing FPT algorithms based on effective kernelizations. This method is called the method of extremal structure. The method operates following a paradigm presented by two lemmas, the kernelization and boundary lemmas. The boundary lemma is used to find theoretical bounds on the maximum size of an instance reduced under an adequate set of reduction rules. The kernelization lemma is invoked to decide the instances which are larger than for some function depending only on the parameter . The first aim of the method of extremal structure is to provide a systematic way to discover reduction rules for fixed-parameter tractable problems. The second is to devise an analytical way to find theoretical bounds for the size of kernels for those problems. These two aims are achieved with the aid of combinatorial extremal arguments. Furthermore, this thesis shows how the method of extremal structure can be applied to effectively solve several NP-complete problems, namely MAX CUT, MAX LEAF SPANNING TREE, NONBLOCKER, -STAR PACKING, EDGE-DISJOINT TRIANGLE PACKING, MAX INTERNAL SPANNING TREE and MINIMUM MAXIMAL MATCHING." @default.
• W561119072 created "2016-06-24" @default.
• W561119072 creator A5006598379 @default.
• W561119072 creator A5085920849 @default.
• W561119072 date "2005-01-01" @default.
• W561119072 modified "2023-09-23" @default.
• W561119072 title "SYSTEMATIC KERNELIZATION IN FPT ALGORITHM DESIGN" @default.
• W561119072 cites W130518292 @default.
• W561119072 cites W1487173148 @default.
• W561119072 cites W1488421129 @default.
• W561119072 cites W1492038308 @default.
• W561119072 cites W1493071618 @default.
• W561119072 cites W1510730180 @default.
• W561119072 cites W1517036688 @default.
• W561119072 cites W1518294541 @default.
• W561119072 cites W1523650025 @default.
• W561119072 cites W1528489445 @default.
• W561119072 cites W1553492721 @default.
• W561119072 cites W1554668720 @default.
• W561119072 cites W1555478065 @default.
• W561119072 cites W1556982589 @default.
• W561119072 cites W1558630420 @default.
• W561119072 cites W1562281457 @default.
• W561119072 cites W1562509859 @default.
• W561119072 cites W1565265107 @default.
• W561119072 cites W1593916827 @default.
• W561119072 cites W1598441350 @default.
• W561119072 cites W1659309517 @default.
• W561119072 cites W1677480546 @default.
• W561119072 cites W1687483116 @default.
• W561119072 cites W174566906 @default.
• W561119072 cites W1804016314 @default.
• W561119072 cites W1959324184 @default.
• W561119072 cites W1969483202 @default.
• W561119072 cites W1972577597 @default.
• W561119072 cites W1972845596 @default.
• W561119072 cites W1972853793 @default.
• W561119072 cites W1976960787 @default.
• W561119072 cites W1981421358 @default.
• W561119072 cites W1985123706 @default.
• W561119072 cites W1987092466 @default.
• W561119072 cites W1988133548 @default.
• W561119072 cites W1993589418 @default.
• W561119072 cites W1995725694 @default.
• W561119072 cites W2003813631 @default.
• W561119072 cites W2004308928 @default.
• W561119072 cites W2005079828 @default.
• W561119072 cites W2006933117 @default.
• W561119072 cites W2007979101 @default.
• W561119072 cites W2011039300 @default.
• W561119072 cites W2011105641 @default.
• W561119072 cites W2013415302 @default.
• W561119072 cites W2013842855 @default.
• W561119072 cites W2026771935 @default.
• W561119072 cites W2027048490 @default.
• W561119072 cites W2029404717 @default.
• W561119072 cites W2030087828 @default.
• W561119072 cites W2031347356 @default.
• W561119072 cites W2035040468 @default.
• W561119072 cites W2035177751 @default.
• W561119072 cites W2036185701 @default.
• W561119072 cites W2036263637 @default.
• W561119072 cites W2036265926 @default.
• W561119072 cites W2038225707 @default.
• W561119072 cites W2040761679 @default.
• W561119072 cites W2043997666 @default.
• W561119072 cites W2046367433 @default.
• W561119072 cites W2051856222 @default.
• W561119072 cites W2059936808 @default.
• W561119072 cites W2061513598 @default.
• W561119072 cites W2064252342 @default.
• W561119072 cites W2067016370 @default.
• W561119072 cites W2071321409 @default.
• W561119072 cites W2073025989 @default.
• W561119072 cites W2075457919 @default.
• W561119072 cites W2087088044 @default.
• W561119072 cites W2090480826 @default.
• W561119072 cites W2093990414 @default.
• W561119072 cites W2096495231 @default.
• W561119072 cites W2096768449 @default.
• W561119072 cites W2101177721 @default.
• W561119072 cites W2108093643 @default.
• W561119072 cites W2108524515 @default.
• W561119072 cites W2112825968 @default.
• W561119072 cites W2126912389 @default.
• W561119072 cites W2140118062 @default.
• W561119072 cites W2141946535 @default.
• W561119072 cites W2144351241 @default.
• W561119072 cites W2147017859 @default.
• W561119072 cites W2149342630 @default.
• W561119072 cites W2156760067 @default.
• W561119072 cites W2157529519 @default.
• W561119072 cites W2157622572 @default.
• W561119072 cites W2159579504 @default.
• W561119072 cites W2161420356 @default.
• W561119072 cites W2168924128 @default.
• W561119072 cites W2170778679 @default.
• W561119072 cites W2296148711 @default.
• W561119072 cites W2486715098 @default.
• W561119072 cites W2692611782 @default.

• next