An Improved Approximation Algorithm for the Capacitated TSP with Pickup and Delivery on a Tree

  • 1


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


This article introduces a new family of Cayley graphs, called k-degree Cayley graphs, for building interconnection networks. The k-degree Cayley graph possesses many valuable topological properties, such as regularity with degree k, logarithmic diameter, and maximal fault tolerance. We present an optimal shortest path routing algorithm for the k-degree Cayley graph. Cycle- embedding and clique-embedding are also discussed.

Author-supplied keywords

  • embedding
  • graph-theoretic interconnection networks
  • network topology
  • shortest path routing algorithm
  • topological properties

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

There are no authors.

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free