Approximation Algorithms with Constant Factors for a Series of Asymmetric Routing Problems

In this paper, the first fixed-ratio approximation algorithms are proposed for a series of asymmetric settings of well-known combinatorial routing problems. Among them are the Steiner cycle problem, the prize-collecting traveling salesman problem, the minimum cost cycle cover problem by a bounded nu...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Doklady. Mathematics Jg. 108; H. 3; S. 499 - 505
Hauptverfasser:	Neznakhina, E. D., Ogorodnikov, Yu. Yu, Rizhenko, K. V., Khachay, M. Yu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Moscow Pleiades Publishing 01.12.2023 Springer Nature B.V
Schlagworte:	Accuracy Algorithms Approximation Asymmetry Combinatorial analysis Costs Customers Fines & penalties Graphs Linear programming Mathematics Mathematics and Statistics Traveling salesman problem Vehicles approximation algorithm constant ratio asymmetric traveling salesman problem cycle cover problem vehicle routing problem Steiner cycle problem
ISSN:	1064-5624, 1531-8362
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!