A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs (Q5111697)

From MaRDI portal
Revision as of 15:58, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7204990
Language Label Description Also known as
English
A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs
scientific article; zbMATH DE number 7204990

    Statements

    0 references
    0 references
    0 references
    27 May 2020
    0 references
    capacitated vehicle routing
    0 references
    approximation algorithms
    0 references
    planar graphs
    0 references
    A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs (English)
    0 references

    Identifiers

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