Monnot Jrme

Jrme Monnot

Information about the author Jrme Monnot will soon be added to the site.
Found 11 papers in total
Some tractable instances of interval data minmax regret problems
Some tractable instances of interval data minmax regret problems
2008
In this paper, we provide polynomial and pseudopolynomial algorithms for classes of...
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation
2010
This article deals with the two-stage stochastic model, which aims at explicitly...
The path partition problem and related problems in bipartite graphs
The path partition problem and related problems in bipartite graphs
2007
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree...
A simple approximation algorithm for WIS based on the approximability in k-partite graphs
A simple approximation algorithm for WIS based on the approximability in k-partite graphs
2006
In this note, simple approximation algorithms for the weighted independent set problem...
Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
2005
This paper deals with the problem of constructing Hamiltonian paths of optimal weight,...
Differential approximation of NP-hard problems with equal size feasible solutions
Differential approximation of NP-hard problems with equal size feasible solutions
2002
In this paper, we focus on some specific optimization problems from graph theory,...
The maximum saving partition problem
The maximum saving partition problem
2005
The input to the maximum saving partition problem consists of a set...
Local approximations for maximum partial subgraph problem
Local approximations for maximum partial subgraph problem
2004
We deal with MAX H 0 -FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum...
Differential approximation results for the traveling salesman problem with distances 1 and 2
Differential approximation results for the traveling salesman problem with distances 1 and 2
2003
We prove that both minimum and maximum traveling salesman problems on complete graphs...
Local search for the minimum label spanning tree problem with bounded color classes
Local search for the minimum label spanning tree problem with bounded color classes
2003
In the Minimum Label Spanning tree problem, the input consists of an edge-colored...
Approximation results toward nearest neighbor heuristic
Approximation results toward nearest neighbor heuristic
2002
In this paper, we revisit the famous heuristic called nearest neighbor ( NN ) for the...
Papers per page: