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

Full description

Bibliographic Details

Published in:	Networks Vol. 70; no. 3; pp. 262 - 278
Main Authors:	van Bevern, René, Komusiewicz, Christian, Sorge, Manuel
Format:	Journal Article
Language:	English
Published:	New York Wiley Subscription Services, Inc 01.10.2017
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!