A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-008-9199-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977376294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels: Annotated, Proper and Induced / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Algorithms for d-Hitting Set Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster exact algorithms for hard problems: A parameterized point of view / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refined search tree technique for dominating set on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call control with \(k\) rejections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Parameterized Upper Bounds for Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new multilayered PCP and the hardness of hypergraph vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A top-down approach to search-trees: Improved algorithmics for 3-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Layer Planarization: Improving on Parameterized Algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Hitting Set: The Weighted Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated generation of search tree algorithms for hard graphs modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods for 3-SAT decision and worst-case analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient fixed-parameter algorithm for 3-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of diagnosis from first principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for finding minimum transversals in rank-3 hypergraphs / rank
 
Normal rank

Latest revision as of 13:03, 2 July 2024

scientific article
Language Label Description Also known as
English
A top-down approach to search-trees: Improved algorithmics for 3-hitting set
scientific article

    Statements

    A top-down approach to search-trees: Improved algorithmics for 3-hitting set (English)
    0 references
    0 references
    0 references
    4 March 2010
    0 references
    0 references
    Hitting set
    0 references
    Parametrized algorithms
    0 references
    0 references
    0 references
    0 references