Approximation results for the weighted P4 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 P4-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 on the establishment it does of the robustness of this algorithm, in the sense that this latter provides good quality solutions, whatever version of the problem is addressed, whatever approximation framework is considered in order to evaluate the approximate solutions.

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

Domaines: Algorithme et structure de données [cs.DS]; Complexité [cs.CC]; Mathématique discrète [cs.DM]

Jérôme Monnot, Sophie Toulouse. Approximation results for the weighted P4 partition problem. FCT' 2005 The symposia on Fundamentals of Computation Theory, 2005, Germany. pp.388-396, ⟨10.1007/11537311_34⟩. ⟨hal-00017259⟩