Parameterized algorithms for \(d\)-hitting set: the weighted case (Q964386): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2010.01.001 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2010.01.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003278864 / 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: Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed-parameter approach to 2-layer planarization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms / 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: Parameterized algorithmics for linear arrangement problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching Trees: An Essay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing diagnoses and systems / 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: On efficient fixed-parameter algorithms for weighted vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence between the minimum covering problem and the maximum matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained weighted matchings and edge coverings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for feedback set problems and their duals in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Computer Science / 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
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2010.01.001 / rank
 
Normal rank

Latest revision as of 10:15, 10 December 2024

scientific article
Language Label Description Also known as
English
Parameterized algorithms for \(d\)-hitting set: the weighted case
scientific article

    Statements

    Parameterized algorithms for \(d\)-hitting set: the weighted case (English)
    0 references
    0 references
    15 April 2010
    0 references
    hitting set problems
    0 references
    parameterized algorithms
    0 references
    search tree algorithms
    0 references

    Identifiers