{"ID":2885288,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2508.05471","arxiv_id":"2508.05471","title":"An Improved Approximation Algorithm for the Capacitated Arc Routing Problem","abstract":"The Capacitated Arc Routing Problem (CARP), introduced by Golden and Wong in 1981, is an important arc routing problem in Operations Research, which generalizes the famous Capacitated Vehicle Routing Problem (CVRP). When every customer has a unit demand, the best known approximation ratio for CARP, given by Jansen in 1993, remains $\\frac{5}{2}-\\frac{1.5}{k}$, where $k$ denotes the vehicle capacity. Based on recent progress in approximating CVRP, we improve this result by proposing a $(\\frac{5}{2}-Θ(\\frac{1}{\\sqrt{k}}))$-approximation algorithm, which to the best of our knowledge constitutes the first improvement over Jansen's bound.","short_abstract":"The Capacitated Arc Routing Problem (CARP), introduced by Golden and Wong in 1981, is an important arc routing problem in Operations Research, which generalizes the famous Capacitated Vehicle Routing Problem (CVRP). When every customer has a unit demand, the best known approximation ratio for CARP, given by Jansen in 1...","url_abs":"https://arxiv.org/abs/2508.05471","url_pdf":"https://arxiv.org/pdf/2508.05471v1","authors":"[\"Jingyang Zhao\",\"Mingyu Xiao\"]","published":"2025-08-07T15:12:05Z","proceeding":"cs.DS","tasks":"[\"cs.DS\"]","methods":"[]","has_code":false}