A special case of set covering problems (Q1908929): 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: Q4132008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME RESULTS ON BUDS, STEMS AND FAULT TOLERANCE IN HYPERCUBES OF DIMENSION ⋚ 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subcube fault-tolerance in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for regular set-covering and threshold synthesis / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00429752 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016643839 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:54, 30 July 2024

scientific article
Language Label Description Also known as
English
A special case of set covering problems
scientific article

    Statements

    A special case of set covering problems (English)
    0 references
    0 references
    0 references
    0 references
    5 May 1996
    0 references
    0 references
    set covering problems
    0 references
    polynomial algorithm
    0 references
    0 references