An exponential time 2-approximation algorithm for bandwidth (Q392018): 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: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C78 / 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: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W40 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6244625 / rank
 
Normal rank
Property / zbMATH Keywords
 
exponential time algorithm
Property / zbMATH Keywords: exponential time algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithm
Property / zbMATH Keywords: approximation algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
graph bandwidth
Property / zbMATH Keywords: graph bandwidth / rank
 
Normal rank
Property / zbMATH Keywords
 
bucket decomposition
Property / zbMATH Keywords: bucket decomposition / rank
 
Normal rank

Revision as of 15:20, 29 June 2023

scientific article
Language Label Description Also known as
English
An exponential time 2-approximation algorithm for bandwidth
scientific article

    Statements

    An exponential time 2-approximation algorithm for bandwidth (English)
    0 references
    0 references
    0 references
    13 January 2014
    0 references
    exponential time algorithm
    0 references
    approximation algorithm
    0 references
    graph bandwidth
    0 references
    bucket decomposition
    0 references

    Identifiers

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