Complexity and approximation of the connected set-cover problem (Q453623): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6087676 / rank
 
Normal rank
Property / zbMATH Keywords
 
connected set-cover
Property / zbMATH Keywords: connected set-cover / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank

Revision as of 11:02, 30 June 2023

scientific article
Language Label Description Also known as
English
Complexity and approximation of the connected set-cover problem
scientific article

    Statements

    Complexity and approximation of the connected set-cover problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 September 2012
    0 references
    connected set-cover
    0 references
    computational complexity
    0 references
    approximation algorithms
    0 references

    Identifiers