The following pages link to Jérôme Monnot (Q243583):
Displaying 50 items.
- Differential approximation results for the traveling salesman and related problems (Q294874) (← links)
- Reoptimization of maximum weight induced hereditary subgraph problems (Q386899) (← links)
- Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
- New candidates welcome! Possible winners with respect to the addition of new candidates (Q449052) (← links)
- (Q483054) (redirect page) (← links)
- A note on the traveling salesman reoptimization problem under vertex insertion (Q483055) (← links)
- A note on the clustered set covering problem (Q496643) (← links)
- The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles (Q497683) (← links)
- Bi-objective matchings with the triangle inequality (Q515541) (← links)
- The price of optimum: complexity and approximation for a matching game (Q521813) (← links)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
- Upper domination: towards a dichotomy through boundary properties (Q722525) (← links)
- (Q880585) (redirect page) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- Congestion games with capacitated resources (Q904685) (← links)
- A better differential approximation ratio for symmetric TSP (Q924134) (← links)
- Approximation results for the weighted \(P_4\) partition problem (Q935845) (← links)
- The minimum reload \(s-t\) path, trail and walk problems (Q987690) (← links)
- Some tractable instances of interval data minmax regret problems (Q1003488) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Reoptimization of minimum and maximum traveling salesman's tours (Q1044031) (← links)
- The labeled perfect matching in bipartite graphs (Q1044711) (← links)
- Weighted coloring: further complexity and approximability results (Q1045908) (← links)
- Bottleneck shortest paths on a partially ordered scale (Q1416100) (← links)
- Local approximations for maximum partial subgraph problem. (Q1426723) (← links)
- Differential approximation results for the Steiner tree problem (Q1431874) (← links)
- The maximum \(f\)-depth spanning tree problem (Q1603381) (← links)
- On maximin share allocations in matroids (Q1628590) (← links)
- Subset sum problems with digraph constraints (Q1631654) (← links)
- Extended spanning star forest problems (Q1699782) (← links)
- The many facets of upper domination (Q1704853) (← links)
- A hypocoloring model for batch scheduling (Q1765371) (← links)
- Approximation algorithms for some vehicle routing problems (Q1765372) (← links)
- On the differential approximation of MIN SET COVER (Q1770405) (← links)
- The maximum saving partition problem (Q1779697) (← links)
- Local search for the minimum label spanning tree problem with bounded color classes. (Q1811627) (← links)
- Approximation algorithms for the traveling salesman problem (Q1812290) (← links)
- Differential approximation results for the traveling salesman problem with distances 1 and 2 (Q1869490) (← links)
- Resilience and optimization of identifiable bipartite graphs (Q1941385) (← links)
- Complexity of trails, paths and circuits in arc-colored digraphs (Q1946225) (← links)
- Single approximation for the biobjective Max TSP (Q1951558) (← links)
- Labeled traveling salesman problems: complexity and approximation (Q1952507) (← links)
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing (Q1961735) (← links)
- On the complexity of the upper \(r\)-tolerant edge cover problem (Q1997258) (← links)
- On the maximum independent set problem in subclasses of subcubic graphs (Q2018543) (← links)
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation (Q2270290) (← links)