A 3/2-approximation for the metric many-visits path TSP

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Notes: In: arXiv:2007.11389 (2020)

Event: Veröffentlichung

(where): Hamburg

(who): Universitätsbibliothek der Technischen Universität Hamburg

(when): 2020

Creator: Bérczi, Kristóf
Mnich, Matthias
Vincze, Roland

DOI: 10.15480/882.4137

URN: urn:nbn:de:gbv:830-882.0100580

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 15.08.2025, 7:22 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Bérczi, Kristóf
Mnich, Matthias
Vincze, Roland
Universitätsbibliothek der Technischen Universität Hamburg

Time of origin

2020

Other Objects (12)

Degree-bounded generalized polymatroids and approximating the metric many-visits TSP

A time- and space-optimal algorithm for the many-visits TSP

Exact and approximation algorithms for many-visits travelling salesperson problems

Diophantine approximation in metric space

A Note on Approximation Algorithms for the Multicriteria Δ-TSP

A (3/2 + 1/e)-Approximation Algorithm for Ordered TSP

Graffiti | Streetart

TSP

Graffiti | Streetart

TSP...

Graffiti | Streetart

'TSP

Graffiti | Streetart

TSP!

Graffiti | Streetart

TSP

Graffiti | Streetart

TSP

Degree-bounded generalized polymatroids and approximating the metric many-visits TSP

A time- and space-optimal algorithm for the many-visits TSP

Exact and approximation algorithms for many-visits travelling salesperson problems

Diophantine approximation in metric space

A Note on Approximation Algorithms for the Multicriteria Δ-TSP

A (3/2 + 1/e)-Approximation Algorithm for Ordered TSP

Graffiti | Streetart

TSP

Graffiti | Streetart

TSP...

Graffiti | Streetart

'TSP

Graffiti | Streetart

TSP!

Graffiti | Streetart

TSP

Graffiti | Streetart

TSP

Degree-bounded generalized polymatroids and approximating the metric many-visits TSP

A time- and space-optimal algorithm for the many-visits TSP

Exact and approximation algorithms for many-visits travelling salesperson problems

Diophantine approximation in metric space

A Note on Approximation Algorithms for the Multicriteria Δ-TSP

A (3/2 + 1/e)-Approximation Algorithm for Ordered TSP

Graffiti | Streetart

TSP

Graffiti | Streetart

TSP...

Graffiti | Streetart

'TSP

Graffiti | Streetart

TSP!

Graffiti | Streetart

TSP

Graffiti | Streetart

TSP

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

A 3/2-approximation for the metric many-visits path TSP

Object Details

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

Degree-bounded generalized polymatroids and approximating the metric many-visits TSP

A time- and space-optimal algorithm for the many-visits TSP

Exact and approximation algorithms for many-visits travelling salesperson problems

Diophantine approximation in metric space

A Note on Approximation Algorithms for the Multicriteria Δ-TSP

A (3/2 + 1/e)-Approximation Algorithm for Ordered TSP

TSP

TSP...

'TSP

TSP!

TSP

TSP

Degree-bounded generalized polymatroids and approximating the metric many-visits TSP

A time- and space-optimal algorithm for the many-visits TSP

Exact and approximation algorithms for many-visits travelling salesperson problems

Diophantine approximation in metric space

A Note on Approximation Algorithms for the Multicriteria Δ-TSP

A (3/2 + 1/e)-Approximation Algorithm for Ordered TSP

TSP

TSP...

'TSP

TSP!

TSP

TSP

Degree-bounded generalized polymatroids and approximating the metric many-visits TSP

A time- and space-optimal algorithm for the many-visits TSP

Exact and approximation algorithms for many-visits travelling salesperson problems

Diophantine approximation in metric space

A Note on Approximation Algorithms for the Multicriteria Δ-TSP

A (3/2 + 1/e)-Approximation Algorithm for Ordered TSP

TSP

TSP...

'TSP

TSP!

TSP

TSP

Related objects

Reset password