Browsing LAMSADE (UMR CNRS 7243) by Author "Monnot, Jérôme"
-
Approximation results for the weighted P4 partition problems
Monnot, Jérôme; Toulouse, Sophie (2005) Communication / Conférence -
Approximation results for the weighted P4 partition problems
Toulouse, Sophie; Monnot, Jérôme (2008) Article accepté pour publication ou publié -
Approximation results toward nearest neighbor heuristic
Monnot, Jérôme (2002) Article accepté pour publication ou publié -
Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems
Bazgan, Cristina; Gourvès, Laurent; Monnot, Jérôme (2012) Communication / Conférence -
Approximation with a fixed number of solutions of some multiobjective maximization problems
Bazgan, Cristina; Gourvès, Laurent; Monnot, Jérôme (2013) Article accepté pour publication ou publié -
A Better differential approximation ratio for symmetric TSP
Escoffier, Bruno; Monnot, Jérôme (2008) Article accepté pour publication ou publié -
Beyond Electing and Ranking: Collective Dominating Chains, Dominating Subsets and Dichotomies
Lang, Jérôme; Monnot, Jérôme; Slinko, Arkadii; Zwicker, William (2017) Communication / Conférence -
Bi-objective matchings with the triangle inequality
Gourvès, Laurent; Monnot, Jérôme; Pascual, Fanny; Vanderpooten, Daniel (2017) Article accepté pour publication ou publié -
Bottleneck shortest paths on a partially ordered scale
Spanjaard, Olivier; Monnot, Jérôme (2003) Article accepté pour publication ou publié -
A Boundary Property for Upper Domination
AbouEisha, Hassan; Hussain, Shahid; Lozin, Vadim; Monnot, Jérôme; Ries, Bernard; Zamaraev, Viktor (2016) Communication / Conférence -
Bridging gap between standard and differential polynomial approximation: the case of bin-packing
Demange, Marc; Monnot, Jérôme; Paschos, Vangelis (1999) Article accepté pour publication ou publié -
Compilation and communication protocols for voting rules with a dynamic set of candidates
Chevaleyre, Yann; Lang, Jérôme; Maudet, Nicolas; Monnot, Jérôme (2011) Communication / Conférence -
Complexity and approximation results for the connected vertex cover problem
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme (2007) Communication / Conférence -
Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs
Khoshkhah, Kaveh; Khosravian Ghadikolaei, Mehdi; Monnot, Jérôme; Theis, Dirk Oliver (2019) Article accepté pour publication ou publié -
Complexity and approximation results for bounded-size paths packing problems
Toulouse, Sophie; Monnot, Jérôme (2007) Chapitre d'ouvrage -
Complexity and Approximation Results for the Connected Vertex Cover Problem in Graphs and Hypergraphs
Monnot, Jérôme; Gourvès, Laurent; Escoffier, Bruno (2010) Article accepté pour publication ou publié -
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme (2007) Document de travail / Working paper -
Complexity and approximation results for the min weighted node coloring problem
Escoffier, Bruno; Demange, Marc; Paschos, Vangelis; de Werra, Dominique; Monnot, Jérôme (2008) Chapitre d'ouvrage -
The Complexity of bottleneck labeled graph problems
Hassin, Refael; Monnot, Jérôme; Segev, Danny (2007) Communication / Conférence -
Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs
Gourvès, Laurent; Lyra, Adria; Martinhon, Carlos A.; Monnot, Jérôme (2010) Communication / Conférence