A tight linear time13/12 13 12 -approximation algorithm for the P 2 | | C max problem

Federico Della Croce (1) , Rosario Scatamacchia (1) , Vincent t'Kindt (2, 3)

1 DIGEP - Department of Management and Production Engineering [Politecnico di Torino]
2 LIFAT - Laboratoire d'Informatique Fondamentale et Appliquée de Tours
3 ROOT - Recherche Opérationnelle, Ordonnancement, Transport ERL 7002

Domaines: Recherche opérationnelle [math.OC]

Federico Della Croce, Rosario Scatamacchia, Vincent t'Kindt. A tight linear time13/12 13 12 -approximation algorithm for the P 2 | | C max problem. Journal of Combinatorial Optimization, 2019, 38 (2), pp.608-617. ⟨10.1007/s10878-019-00399-w⟩. ⟨hal-03001059⟩