Please use this identifier to cite or link to this item:
Fulltext available Open Access
arXiv ID: 1911.09890
Title: Degree-bounded generalized polymatroids and approximating the metric many-visits TSP
Language: English
Authors: Bérczi, Kristóf 
Berger, André 
Mnich, Matthias  
Vincze, Roland  
Keywords: generalized polymatroids; degree constraints; traveling salesman problem
Issue Date: 2019
Source: arxiv:1911.09890 (2019)
DOI: 10.15480/882.4143
Institute: Algorithmen und Komplexität E-11 
Document Type: Preprint
Project: Multivariate Algorithmen für Scheduling mit hoher Multiplizität 
More Funding information: Kristóf was supported by the János Bolyai Research Fellowship of the Hungarian Academy of Sciences and by the UNKP-19-4 New National Excellence Program of the Ministry for Innovation and Technology. Project no. NKFI-128673 has been implemented with the support provided from the National Research, Development and Innovation Fund of Hungary, financed under the FK 18 funding scheme. This research was supported by Thematic Excellence Programme, Industry and Digitization Subprogramme, NRDI Office, 2019.
License: In Copyright In Copyright
Appears in Collections:Publications with fulltext

Files in This Item:
File Description SizeFormat
1911.09890.pdf525,36 kBAdobe PDFView/Open
Show full item record

Page view(s)

Last Week
Last month
checked on Jun 2, 2023


checked on Jun 2, 2023

Google ScholarTM


Note about this record

Cite this record


Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.