A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments

We prove that any polynomial‐time α ( n ) ‐approximation algorithm for the n‐vertex metric asymmetric Traveling Salesperson Problem yields a polynomial‐time O ( α ( C ) ) ‐approximation algorithm for the mixed and windy Capacitated Arc Routing Problem, where C is the number of weakly connected compo...

Celý popis

Podrobná bibliografia

Vydané v:	Networks Ročník 70; číslo 3; s. 262 - 278
Hlavní autori:	van Bevern, René, Komusiewicz, Christian, Sorge, Manuel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Wiley Subscription Services, Inc 01.10.2017
Predmet:	Algorithms Approximation Benchmarks Chinese Postman combinatorial optimization Computer simulation fixed‐parameter algorithm Mathematical analysis NP‐hard problem Polynomials Production scheduling Rural Postman transportation vehicle routing
ISSN:	0028-3045, 1097-0037
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!