<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05722013</id>
  <dt>j</dt>
  <an>05722013</an>
  <augroup>
    <au>Nagoya, Takayuki</au>
  </augroup>
  <ti>New differential approximation algorithm for $k$-customer vehicle routing problem.</ti>
  <so>Inf. Process. Lett. 109, No. 8, 405-408 (2009).</so>
  <py>2009</py>
  <pu>Elsevier Sciences Publishers (North-Holland), Amsterdam</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>approximation algorithms</ut>
    <ut>vehicle routing problem</ut>
    <ut>differential approximation ratio</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/j.ipl.2008.12.018</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We present a differential approximation algorithm for $k$-customer vehicle routing problem. It is known that this problem is $\frac{1}{2}$ differential approximable for $k \geqslant 3$. It is also known that, if the triangle inequality is satisfied, then this problem is $\frac{3}{5}$ differential approximable for $k=4$ and $\frac{2}{3}$ differential approximable for $5 \leqslant k \leqslant 8$. Our algorithm achieves $\frac{3}{5}$ differential approximation ratio for $k=4$ and $\frac{2}{3}$ differential approximation ratio for $k \geqslant 5$ without assuming the triangle inequality holds.</ab>
    <rv></rv>
  </abgroup>
</item>