Monnot, Jérôme; Fernau, Henning; Manlove, David Algorithmic aspects of upper edge domination. (English) Zbl 1516.68070 Theor. Comput. Sci. 877, 46-57 (2021). MSC: 68R10 05C69 68Q17 68W25 PDFBibTeX XMLCite \textit{J. Monnot} et al., Theor. Comput. Sci. 877, 46--57 (2021; Zbl 1516.68070) Full Text: DOI
Boria, Nicolas; Monnot, Jérôme; Paschos, Vangelis Th. Reoptimization of maximum weight induced hereditary subgraph problems. (English) Zbl 1277.68085 Theor. Comput. Sci. 514, 61-74 (2013). MSC: 68Q17 68W25 68R10 90C27 PDFBibTeX XMLCite \textit{N. Boria} et al., Theor. Comput. Sci. 514, 61--74 (2013; Zbl 1277.68085) Full Text: DOI
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. (English) Zbl 1214.05162 J. Discrete Algorithms 8, No. 1, 36-49 (2010). MSC: 05C85 05C70 05C10 68W25 PDFBibTeX XMLCite \textit{B. Escoffier} et al., J. Discrete Algorithms 8, No. 1, 36--49 (2010; Zbl 1214.05162) Full Text: DOI
Monnot, Jérôme; Toulouse, Sophie Approximation results for the weighted \(P_4\) partition problem. (English) Zbl 1146.05315 J. Discrete Algorithms 6, No. 2, 299-312 (2008). MSC: 05C85 68W25 PDFBibTeX XMLCite \textit{J. Monnot} and \textit{S. Toulouse}, J. Discrete Algorithms 6, No. 2, 299--312 (2008; Zbl 1146.05315) Full Text: DOI
Escoffier, Bruno; Monnot, Jérôme A better differential approximation ratio for symmetric TSP. (English) Zbl 1145.68051 Theor. Comput. Sci. 396, No. 1-3, 63-70 (2008). MSC: 68W25 90C35 90C59 PDFBibTeX XMLCite \textit{B. Escoffier} and \textit{J. Monnot}, Theor. Comput. Sci. 396, No. 1--3, 63--70 (2008; Zbl 1145.68051) Full Text: DOI
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme Complexity and approximation results for the connected vertex cover problem. (English) Zbl 1141.68525 Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 33rd international workshop, WG 2007, Dornburg, Germany, June 21–23, 2007. Revised papers. Berlin: Springer (ISBN 978-3-540-74838-0/pbk). Lecture Notes in Computer Science 4769, 202-213 (2007). MSC: 68R10 05C70 05C85 68Q25 68W25 PDFBibTeX XMLCite \textit{B. Escoffier} et al., Lect. Notes Comput. Sci. 4769, 202--213 (2007; Zbl 1141.68525) Full Text: DOI
Monnot, Jérôme; Toulouse, Sophie The path partition problem and related problems in bipartite graphs. (English) Zbl 1129.05034 Oper. Res. Lett. 35, No. 5, 677-684 (2007). MSC: 05C70 05C85 68Q17 PDFBibTeX XMLCite \textit{J. Monnot} and \textit{S. Toulouse}, Oper. Res. Lett. 35, No. 5, 677--684 (2007; Zbl 1129.05034) Full Text: DOI
Bazgan, Cristina; Monnot, Jérôme; Paschos, Vangelis Th.; Serriére, Fabrice On the differential approximation of MIN SET COVER. (English) Zbl 1070.68153 Theor. Comput. Sci. 332, No. 1-3, 497-513 (2005). MSC: 68W25 90C59 PDFBibTeX XMLCite \textit{C. Bazgan} et al., Theor. Comput. Sci. 332, No. 1--3, 497--513 (2005; Zbl 1070.68153) Full Text: DOI
Monnot, Jérôme; Paschos, Vangelis Th.; Toulouse, Sophie Differential approximation results for the traveling salesman problem with distances 1 and 2. (English) Zbl 1012.90044 Eur. J. Oper. Res. 145, No. 3, 557-568 (2003). MSC: 90C27 PDFBibTeX XMLCite \textit{J. Monnot} et al., Eur. J. Oper. Res. 145, No. 3, 557--568 (2003; Zbl 1012.90044) Full Text: DOI
Monnot, Jérôme Differential approximation of NP-hard problems with equal size feasible solutions. (English) Zbl 1037.90059 RAIRO, Oper. Res. 36, No. 4, 279-297 (2002). MSC: 90C59 90C60 68W25 68W40 90C35 PDFBibTeX XMLCite \textit{J. Monnot}, RAIRO, Oper. Res. 36, No. 4, 279--297 (2002; Zbl 1037.90059) Full Text: DOI Numdam EuDML Link