cs.DM · 2026-06-02 · No. 13

Discrete Mathematics, 2026-06-02.

1 new papers in cs.DM. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

1 entries
  1. 01

    Graph Edit Distance Formulation for the Vehicle Routing Problem: Theory and Analysis

    Adel Dabah

    cs.DM · cs.LG

    We show that the Vehicle Routing Problem (VRP) can be reformulated as a Graph Edit Distance (GED) maximization problem. Under a simple edge-deletion cost model, minimizing total route cost is equivalent to maximizing the total weight of edges deleted from the complete instance graph. This formulation models VRP at the edge level, where solutions are defined by selected edges rather than route sequences, enabling structural analyses that are...

    arxiv.org/abs/2606.01987 · PDF

This edition is part of The Daily Abstract — cs.DM archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.