An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient algorithms for decomposing graphs under degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Pósa property for long circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel bounds for disjoint cycles and disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minors in graphs of large \(\theta_r\)-girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-treewidth graph decompositions and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Pósa property for clique minors in highly connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree-partitions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Circuits Contained in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting Diamonds and Growing Cacti / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded Forest Minors and the Erdős–Pósa Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdös-Pósa property for matroid circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-partitions of infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting and Harvesting Pumpkins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint Odd Cycles in 4-edge-connected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint odd cycles in planar graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint cycles intersecting a set of vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Pósa property for odd cycles in highly connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An edge variant of the Erdős-Pósa property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent techniques and results on the Erdős-Pósa property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing directed circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Cycles: Integrality Gap, Hardness, and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3692864 / rank
 
Normal rank

Latest revision as of 16:04, 15 July 2024

scientific article
Language Label Description Also known as
English
An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
scientific article

    Statements

    An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 May 2018
    0 references
    Erdős-Pósa property
    0 references
    packings in graphs
    0 references
    coverings in graphs
    0 references
    minor-models of \(\theta _{r}\)
    0 references
    approximation algorithms
    0 references
    protrusion decomposition
    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
    0 references