{
  "abstract": "We devise a polynomial-time $3.159$-approximation algorithm for the metric unsplittable Capacitated Vehicle Routing Problem. We build on the Relative Greedy Algorithm suggested by Traub (2025), which can be considered as a variant of the LP rounding algorithm of Friggstad, Mousavi, Rahgoshay, and Salavatipour (2025). Our main ingredient is the Average Greedy Algorithm, a new algorithm that controls both tour costs and the coverage of clients with high demand. This additional control enables a sharper averaging argument for the cost of subsequent greedy choices. Similarly to Zhao and Xiao (2026), combining the Average Greedy with variants of tour partitioning and a matching algorithm yields the final approximation guarantee.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.16910",
  "author_total": 2,
  "authors": [
    {
      "name": "Daniel Ebert"
    },
    {
      "name": "Leonard Weismantel"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/4x54p6xf4e2fg.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.16910",
  "fulltext_url": null,
  "id": "4x54p6xf4e2fg",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.16910",
  "language": null,
  "licence": "CC-BY-NC-ND-4.0",
  "licence_label": "CC BY-NC-ND 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by-nc-nd/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.DS"
    ],
    [
      "arxiv",
      "math.CO"
    ],
    [
      "openalex",
      "2209|Vehicle Routing Optimization Methods"
    ]
  ],
  "openalex": "W7213415517",
  "pdf_url": "https://arxiv.org/pdf/2609.16910",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-15",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/4x54p6xf4e2fg.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:21:45Z",
      "native_id": "2609.16910",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.16910"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "Improved Approximation for Unsplittable CVRP via a Greedy Approach",
  "title_text": "Improved Approximation for Unsplittable CVRP via a Greedy Approach",
  "type": "preprint",
  "updated_at": "2026-10-30T12:21:45Z",
  "url": "https://research.draconitic.com/paper/4x54p6xf4e2fg",
  "venue": "arXiv",
  "versions": []
}