Optimal deterministic algorithms for some variants of online quota traveling salesman problem (Q296870): 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: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6597568 / rank
 
Normal rank
Property / zbMATH Keywords
 
traveling salesman
Property / zbMATH Keywords: traveling salesman / rank
 
Normal rank
Property / zbMATH Keywords
 
quota TSP
Property / zbMATH Keywords: quota TSP / rank
 
Normal rank
Property / zbMATH Keywords
 
online algorithm
Property / zbMATH Keywords: online algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
competitive ratio
Property / zbMATH Keywords: competitive ratio / rank
 
Normal rank

Revision as of 21:02, 27 June 2023

scientific article
Language Label Description Also known as
English
Optimal deterministic algorithms for some variants of online quota traveling salesman problem
scientific article

    Statements

    Optimal deterministic algorithms for some variants of online quota traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    23 June 2016
    0 references
    traveling salesman
    0 references
    quota TSP
    0 references
    online algorithm
    0 references
    competitive ratio
    0 references

    Identifiers