Emergent Mind
Constant-factor approximations for Capacitated Arc Routing without triangle inequality
(1404.3660)
Published Apr 14, 2014
in
cs.DS
,
cs.DM
,
and
math.CO
Abstract
Given an undirected graph with edge costs and edge demands, the Capacitated Arc Routing problem (CARP) asks for minimum-cost routes for equal-capacity vehicles so as to satisfy all demands. Constant-factor polynomial-time approximation algorithms were proposed for CARP with triangle inequality, while CARP was claimed to be NP-hard to approximate within any constant factor in general. Correcting this claim, we show that any factor {\alpha} approximation for CARP with triangle inequality yields a factor {\alpha} approximation for the general CARP.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.