( en | de | ru )

 

Disambiguation of "Monnot, Jérôme"

Author of the publication

copydeleteadd this publication to your clipboard
(Non)-Approximability for the Multi-criteria TSP(1, 2).

, , , and . FCT, volume 3623 of Lecture Notes in Computer Science, page 329-340. Springer, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jérôme Huppertz

Modulation inflammatorischer Prozesse mittels GPI-verankerter Chemokin-Analoga. Uni München, (2009)

Jérôme Clerc

Jérôme Boucher

Jérôme Krets

Jérôme Feret

 

Other publications of authors with the same name

The labeled perfect matching in bipartite graphs.. Inf. Process. Lett., 96 (3): 81-88 (2005)The maximum f-depth spanning tree problem.. Inf. Process. Lett., 80 (4): 179-187 (2001)Differential approximation results for the traveling salesman and related problems.. Inf. Process. Lett., 82 (5): 229-235 (2002)Approximation algorithms and hardness results for labeled connectivity problems., , and . J. Comb. Optim., 14 (4): 437-453 (2007)Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems., , and . WAOA, volume 7164 of Lecture Notes in Computer Science, page 233-246. Springer, (2011)On the complexity of the selective graph coloring problem in some special classes of graphs., , , and . Theor. Comput. Sci., (2014)Weighted Upper Edge Cover: Complexity and Approximability., , , and . WALCOM, volume 11355 of Lecture Notes in Computer Science, page 235-247. Springer, (2019)Correction to: Weighted Upper Edge Cover: Complexity and Approximability., , , and . WALCOM, volume 11355 of Lecture Notes in Computer Science, Springer, (2019)Approximate Maximin Share Allocations in Matroids., and . CIAC, volume 10236 of Lecture Notes in Computer Science, page 310-321. (2017)The Price of Optimum: Complexity and Approximation for a Matching Game., , and . Algorithmica, 77 (3): 836-866 (2017)