Approximating vertex cover in dense hypergraphs (Q450531): 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: 68Q17 / 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: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C65 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6082036 / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation hardness
Property / zbMATH Keywords: approximation hardness / rank
 
Normal rank
Property / zbMATH Keywords
 
vertex cover
Property / zbMATH Keywords: vertex cover / rank
 
Normal rank
Property / zbMATH Keywords
 
set cover
Property / zbMATH Keywords: set cover / rank
 
Normal rank
Property / zbMATH Keywords
 
dense hypergraphs
Property / zbMATH Keywords: dense hypergraphs / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-partite \(k\)-uniform hypergraphs
Property / zbMATH Keywords: \(k\)-partite \(k\)-uniform hypergraphs / rank
 
Normal rank

Revision as of 11:14, 30 June 2023

scientific article
Language Label Description Also known as
English
Approximating vertex cover in dense hypergraphs
scientific article

    Statements

    Approximating vertex cover in dense hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 September 2012
    0 references
    approximation algorithms
    0 references
    approximation hardness
    0 references
    vertex cover
    0 references
    set cover
    0 references
    dense hypergraphs
    0 references
    \(k\)-partite \(k\)-uniform hypergraphs
    0 references

    Identifiers

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