A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP

We present a primal-dual ⌈log( n )⌉-approximation algorithm for the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such that the length of the tour plus the sum of penalties associated with vertic...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of combinatorial optimization Ročník 25; číslo 2; s. 265 - 278
Hlavný autor:	Nguyen, Viet Hung
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.02.2013 Springer Science + Business Media Springer Verlag
Predmet:	Combinatorics Computer Science Convex and Discrete Geometry Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation Approximation algorithm Prize collecting Traveling Salesman Primal-dual algorithm
ISSN:	1382-6905, 1573-2886
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!