Approximating the multi-level bottleneck assignment problem (Q453052): 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: 90B80 / 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: 6083704 / rank
 
Normal rank
Property / zbMATH Keywords
 
bottleneck problem
Property / zbMATH Keywords: bottleneck problem / rank
 
Normal rank
Property / zbMATH Keywords
 
multidimensional assignment
Property / zbMATH Keywords: multidimensional assignment / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation
Property / zbMATH Keywords: approximation / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
efficient algorithm
Property / zbMATH Keywords: efficient algorithm / rank
 
Normal rank

Revision as of 11:53, 30 June 2023

scientific article
Language Label Description Also known as
English
Approximating the multi-level bottleneck assignment problem
scientific article

    Statements

    Approximating the multi-level bottleneck assignment problem (English)
    0 references
    0 references
    0 references
    0 references
    18 September 2012
    0 references
    bottleneck problem
    0 references
    multidimensional assignment
    0 references
    approximation
    0 references
    computational complexity
    0 references
    efficient algorithm
    0 references

    Identifiers