A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs (Q5111697): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
label / en | label / en | ||
A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs | |||
Property / full work available at URL | |||
Property / full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2017/7878/pdf/LIPIcs-ESA-2017-12.pdf / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2966058519 / rank | |||
Normal rank | |||
Property / title | |||
A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs (English) | |||
Property / title: A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs (English) / rank | |||
Normal rank |
Revision as of 10:01, 30 July 2024
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
27 May 2020
0 references
capacitated vehicle routing
0 references
approximation algorithms
0 references
planar graphs
0 references
0 references
A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs (English)
0 references