Exact algorithms and applications for tree-like Weighted Set Cover (Q866547): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Decompositions of Graphs: Saving Memory in Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost Linear-Time Algorithm for Graph Realization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined memorization for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual approximation algorithms for integral flow and multicut in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and data reduction for multicut in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating k-set cover and complementary graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Capacity Scheduling—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical algorithms on partial k-trees with an application to domination-like problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Determining Whether a Given Binary Matroid is Graphic / rank
 
Normal rank

Revision as of 13:31, 25 June 2024

scientific article
Language Label Description Also known as
English
Exact algorithms and applications for tree-like Weighted Set Cover
scientific article

    Statements

    Exact algorithms and applications for tree-like Weighted Set Cover (English)
    0 references
    0 references
    0 references
    14 February 2007
    0 references
    NP-hard problems
    0 references
    Weighted Set Cover
    0 references
    multicut in trees
    0 references
    Minimum Weighted Edge Cover on acyclic hypergraphs
    0 references
    fixed-parameter tractability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references