An approximation algorithm for the k-fixed depots problem - Université de Picardie Jules Verne Accéder directement au contenu
Article Dans Une Revue Computers & Industrial Engineering Année : 2017

An approximation algorithm for the k-fixed depots problem

A. Giannakos
  • Fonction : Auteur
  • PersonId : 947024
  • IdRef : 193460564
R. Kheffache
  • Fonction : Auteur


In this paper, we consider the k-Depots Hamiltonian Path Problem (k-DHPP) of searching k paths in a graph G, starting from k fixed vertices and spanning all the vertices of G. We propose an approximation algorithm for solving the k-DHPP, where the underlying graph is cubic and 2-vertex-connected. Then, we prove the existence of a 5/3-approximation algorithm that gives a solution with total cost at most (5/3n - 4k-2/3). In this case, the proposed method is based upon searching for a perfect matching, constructing an Eulerian graph and finally a k paths solution, following the process of removing/adding edges. We also present an approximation algorithm for finding a shortest tour passing through all vertices in a factor-critical and 2-vertex connected graph. The proposed algorithm achieves a 7/6-approximation ratio where the principle of the method is based on decomposing the graph into a series of ears. (C) 2017 Published by Elsevier Ltd.
Fichier non déposé

Dates et versions

hal-03617899 , version 1 (23-03-2022)



A. Giannakos, Mhand Hifi, R. Kheffache, Rachid Ouafi. An approximation algorithm for the k-fixed depots problem. Computers & Industrial Engineering, 2017, 111, pp.50-55. ⟨10.1016/j.cie.2017.06.022⟩. ⟨hal-03617899⟩


16 Consultations
0 Téléchargements



Gmail Mastodon Facebook X LinkedIn More