On approximate algorithms for combinatorial linear maximization problems (Q3912014): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: K-greedy algorithms for independence systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of the Greedy Heuristic for Independence Systems / rank
 
Normal rank

Latest revision as of 12:27, 13 June 2024

scientific article
Language Label Description Also known as
English
On approximate algorithms for combinatorial linear maximization problems
scientific article

    Statements

    On approximate algorithms for combinatorial linear maximization problems (English)
    0 references
    1980
    0 references
    combinatorial programming
    0 references
    approximative algorithms
    0 references
    guaranteed performance
    0 references

    Identifiers