A simple PTAS for weighted matroid matching on strongly base orderable matroids (Q2448875): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Random pseudo-polynomial algorithms for exact matroid problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Matroid Property Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3934404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arborescences and Edge-Disjoint Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680844 / rank
 
Normal rank

Latest revision as of 11:19, 8 July 2024

scientific article
Language Label Description Also known as
English
A simple PTAS for weighted matroid matching on strongly base orderable matroids
scientific article

    Statements

    A simple PTAS for weighted matroid matching on strongly base orderable matroids (English)
    0 references
    5 May 2014
    0 references
    matroid matching
    0 references
    matroid parity
    0 references
    strongly base orderable matroids
    0 references
    local search
    0 references
    PTAS
    0 references
    0 references

    Identifiers