Search
Now showing items 1-10 of 65
Solving vertex cover, independent set and related problems by a Boltzmann machine
(1992) Communication / Conférence
Differential approximation of MIN SAT, MAX SAT and related problems
(2005) Communication / Conférence
Maximum independent set and linear programming
(1995) Communication / Conférence
On the approximation of NP-complete problems by using Boltzmann machine method. The cases of some covering and packing problems
(1991) Communication / Conférence
The hypocoloring problem: complexity and approximability results when the chromatic number is small
(2004) Communication / Conférence
On the mean execution time of recursive definitions on relational databases
(1991) Communication / Conférence
Weighted node coloring: when stable sets are expensive
(2002) Communication / Conférence
A theorem on the approximation of set cover and vertex cover
(1991) Communication / Conférence
Réductions continues: un outil pour préserver l'approximabilité
(1998) Communication / Conférence
Well solved cases of probabilistic traveling salesman problem
(2010) Communication / Conférence