Citation: M. Demange et al., DIFFERENTIAL APPROXIMATION ALGORITHMS FOR SOME COMBINATORIAL OPTIMIZATION PROBLEMS, Theoretical computer science, 209(1-2), 1998, pp. 107-122
Citation: Wf. Delavega et al., AVERAGE-CASE COMPLEXITY FOR THE EXECUTION OF RECURSIVE DEFINITIONS ONRELATIONAL DATABASES, Acta informatica, 35(3), 1998, pp. 211-243
Citation: M. Demange et Vt. Paschos, THE APPROXIMABILITY BEHAVIOR OF SOME COMBINATORIAL PROBLEMS WITH RESPECT TO THE APPROXIMABILITY OF A CLASS OF MAXIMUM INDEPENDENT SET PROBLEMS, COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 7(3), 1997, pp. 307-324
Citation: M. Demange et Vt. Paschos, IMPROVED APPROXIMATIONS FOR MAXIMUM INDEPENDENT SET VIA APPROXIMATIONCHAINS, Applied mathematics letters, 10(3), 1997, pp. 105-110
Citation: Vt. Paschos et M. Demange, A GENERALIZATION OF KONIG-EGERVARY GRAPHS AND HEURISTICS FOR THE MAXIMUM INDEPENDENT SET PROBLEM WITH IMPROVED APPROXIMATION RATIOS, European journal of operational research, 97(3), 1997, pp. 580-592
Citation: Vt. Paschos, A SURVEY OF APPROXIMATELY OPTIMAL-SOLUTIONS TO SOME COVERING AND PACKING PROBLEMS, ACM computing surveys, 29(2), 1997, pp. 171-209
Authors:
BENKOUAR A
MANOUSSAKIS Y
PASCHOS VT
SAAD R
Citation: A. Benkouar et al., HAMILTONIAN PROBLEMS IN EDGE-COLORED COMPLETE GRAPHS AND EULERIAN CYCLES IN EDGE-COLORED GRAPHS - SOME COMPLEXITY RESULTS, RAIRO. Recherche operationnelle, 30(4), 1996, pp. 417-438
Citation: M. Demange et Vt. Paschos, ON AN APPROXIMATION MEASURE FOUNDED ON THE LINKS BETWEEN OPTIMIZATIONAND POLYNOMIAL-APPROXIMATION THEORY, Theoretical computer science, 158(1-2), 1996, pp. 117-141
Citation: M. Afif et al., A NATURAL MODEL AND A PARALLEL ALGORITHM FOR APPROXIMATELY SOLVING THE MAXIMUM WEIGHTED INDEPENDENT SET PROBLEM, Chaos, solitons and fractals, 5(5), 1995, pp. 739-746
Citation: J. Blot et al., AVERAGE-CASE ANALYSIS OF GREEDY ALGORITHM S FOR OPTIMIZATION PROBLEMSON SET SYSTEMS, Comptes rendus de l'Academie des sciences. Serie 1, Mathematique, 321(6), 1995, pp. 805-808
Citation: M. Demange et Vt. Paschos, THE APPROXIMABILITY BEHAVIOR OF SOME COMB INATORIAL PROBLEMS WITH RESPECT TO THE APPROXIMABILITY OF A CLASS OF MAXIMUM INDEPENDENT SET PROBLEMS, Comptes rendus de l'Academie des sciences. Serie 1, Mathematique, 321(5), 1995, pp. 645-648
Citation: C. Murat et Vt. Paschos, PROBABILISTIC INDEPENDENT SET PROBLEM, Comptes rendus de l'Academie des sciences. Serie 1, Mathematique, 321(4), 1995, pp. 495-498
Citation: M. Bellalouna et al., PROBABILISTIC COMBINATORIAL OPTIMIZATION PROBLEMS ON GRAPHS - A NEW DOMAIN IA OPERATIONAL-RESEARCH, European journal of operational research, 87(3), 1995, pp. 693-706
Citation: J. Blot et al., AVERAGE-CASE ANALYSIS OF GREEDY ALGORITHMS FOR OPTIMIZATION PROBLEMS ON SET SYSTEMS, Theoretical computer science, 147(1-2), 1995, pp. 267-298
Citation: M. Afif et al., A NEW EFFICIENT HEURISTIC FOR THE MINIMUM SET COVERING PROBLEM, The Journal of the Operational Research Society, 46(10), 1995, pp. 1260-1268
Citation: M. Demange et al., SOME APPROXIMATION RESULTS IN THE FRAME O F A NEW POLYNOMIAL-APPROXIMATION THEORY, Comptes rendus de l'Academie des sciences. Serie 1, Mathematique, 318(3), 1994, pp. 289-292
Citation: Vt. Paschos, A RELATION BETWEEN THE APPROXIMATED VERSIONS OF MINIMUM SET COVERING,MINIMUM VERTEX COVERING AND MAXIMUM INDEPENDENT SET, RAIRO. Recherche operationnelle, 28(4), 1994, pp. 413-433
Citation: M. Demange et Vt. Paschos, SOME STEPS TOWARDS THE CONCILIATION OF AP PROXIMATION AND OPTIMIZATION THEORY - A NEW SUGGESTED APPROXIMATION MEASURE AND PRELIMINARY-RESULTS, Comptes rendus de l'Academie des sciences. Serie 1, Mathematique, 317(4), 1993, pp. 409-414