Approximation algorithms for some min-max postmen cover problems (Q2241210): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1007/s10479-021-03933-4 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S10479-021-03933-4 / rank
 
Normal rank

Latest revision as of 16:41, 17 December 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for some min-max postmen cover problems
scientific article

    Statements

    Approximation algorithms for some min-max postmen cover problems (English)
    0 references
    0 references
    0 references
    0 references
    8 November 2021
    0 references
    approximation algorithm
    0 references
    traveling salesman problem
    0 references
    rural postman problem
    0 references
    Chinese postman problem
    0 references
    postmen cover
    0 references

    Identifiers