K-greedy algorithms for independence systems (Q4173194): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the worst-case complexity of some oracle algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of the Greedy Heuristic for Independence Systems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01917662 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069448900 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:46, 30 July 2024

scientific article; zbMATH DE number 3607811
Language Label Description Also known as
English
K-greedy algorithms for independence systems
scientific article; zbMATH DE number 3607811

    Statements

    K-greedy algorithms for independence systems (English)
    0 references
    0 references
    0 references
    1978
    0 references
    Independence Systems
    0 references
    Greedy Algorithm
    0 references
    Combinatorial Optimization
    0 references
    Enumeration
    0 references
    Computational Efficiency
    0 references

    Identifiers

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