Approximation results for the weighted $P_{4}$ partition problem

Jérôme Monnot (1) , Sophie Toulouse (2)

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision
2 LIPN - Laboratoire d'Informatique de Paris-Nord

We present several new standard and differential approximation results for the P$_4$-partition problem using the Hassin and Rubinstein algorithm (Information Processing Letters, 63: 63-67, 1997). Those results concern both minimization and maximization versions of the problem. However, the main point of this paper lies in the establishment of the robustness of this algorithm, in the sense that it provides good quality solutions for a variety of versions of the problem, under both standard and differential approximation ratio.

Mots clés: graph partitioning; $P_4$-packing; approximation algorithms; performance ratio; standard approximation; differential approximation

Domaines: Complexité [cs.CC]

Jérôme Monnot, Sophie Toulouse. Approximation results for the weighted $P_{4}$ partition problem. Journal of Discrete Algorithms, 2007, ⟨10.1016/j.jda.2007.01.006⟩. ⟨hal-00152281⟩