A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments
Sign Up to like & getrecommendations! Published in 2017 at "Networks"
DOI: 10.1002/net.21742
Abstract: 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… read more here.
Keywords: approximation algorithm; approximation; polynomial time; problem ... See more keywords