Matching and weighted \(P_2\)-packing: algorithms and kernels (Q393902): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2013.12.011 / rank
Normal rank
 
Property / author
 
Property / author: Jian'er Chen / rank
Normal rank
 
Property / author
 
Property / author: Jian'er Chen / rank
 
Normal rank
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.1016/j.tcs.2013.12.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1986069448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for some vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved parameterized set splitting algorithms: A Probabilistic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the test cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Deterministic Algorithms for Weighted Matching and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parameterized perspective on packing paths of length two / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for maximum triangle packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness of a generalized matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum bounded \(H\)-matching is Max SNP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algebraic Algorithms for Path and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of General Graph Factor Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The P k Partition Problem and Related Problems in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Looking at the stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O *(3.523k ) Parameterized Algorithm for 3-Set Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Parameterized Algorithm for a Generalized Matching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2013.12.011 / rank
 
Normal rank

Latest revision as of 16:14, 9 December 2024

scientific article
Language Label Description Also known as
English
Matching and weighted \(P_2\)-packing: algorithms and kernels
scientific article

    Statements

    Matching and weighted \(P_2\)-packing: algorithms and kernels (English)
    0 references
    0 references
    0 references
    0 references
    24 January 2014
    0 references
    parameterized algorithm
    0 references
    kernelization
    0 references
    weighted \(P_2\)-packing
    0 references
    matching
    0 references

    Identifiers

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