A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments

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

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	René van Bevern, Komusiewicz, Christian, Sorge, Manuel
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 16.10.2016
Subjects:	Algorithms Approximation Benchmarks Computer simulation Graph theory Mathematical analysis Polynomials Production scheduling
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!