Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Bruno Escoffier / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6029131 / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
exponential time algorithms
Property / zbMATH Keywords: exponential time algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
maximum independent set
Property / zbMATH Keywords: maximum independent set / rank
 
Normal rank
Property / zbMATH Keywords
 
minimum vertex cover
Property / zbMATH Keywords: minimum vertex cover / rank
 
Normal rank

Revision as of 19:44, 29 June 2023

scientific article
Language Label Description Also known as
English
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
scientific article

    Statements

    Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    exponential time algorithms
    0 references
    maximum independent set
    0 references
    minimum vertex cover
    0 references