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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Doklady. Mathematics Ročník 108; číslo 3; s. 499 - 505
Hlavní autoři:	Neznakhina, E. D., Ogorodnikov, Yu. Yu, Rizhenko, K. V., Khachay, M. Yu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Moscow Pleiades Publishing 01.12.2023 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!