A dual approximation approach to weighted matroid intersection (Q1919181): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q126536206, #quickstatements; #temporary_batch_1722372779079
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Two algorithms for weighted matroid intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weighted matroid intersection algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN EFFICIENT COST SCALING ALGORITHM FOR THE INDEPENDENT ASSIGNMENT PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems analysis by graphs and matroids. Structural solvability and controllability / rank
 
Normal rank
Property / cites work
 
Property / cites work: New scaling algorithms for the assignment and minimum mean cycle problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid theory and its applications in electric network theory and in statics / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126536206 / rank
 
Normal rank

Latest revision as of 21:57, 30 July 2024

scientific article
Language Label Description Also known as
English
A dual approximation approach to weighted matroid intersection
scientific article

    Statements

    A dual approximation approach to weighted matroid intersection (English)
    0 references
    0 references
    0 references
    1 August 1996
    0 references
    scaling algorithm
    0 references
    minimum weight common base
    0 references
    pair of matroids
    0 references

    Identifiers