Valeurs extrémales d'un problème d'optimisation combinatoire et approximation polynomiale
Marc Demange; Vangelis Th. Paschos
Mathématiques et Sciences Humaines (1996)
- Volume: 135, page 51-66
- ISSN: 0987-6936
Access Full Article
topAbstract
topHow to cite
topReferences
top- [1] Arora S., Lund C., Motwani R., Sudan M., Szegedy M., "proof verification and intractability of approximation problems" , Proc. FOCS (1992), 14-23. Zbl0977.68539
- [2] Aspvall B., Stone R.E., "Khachiyan's linear programming algorithm ", J. Algorithms, 1 (1980), 1-13. Zbl0438.90053MR578074
- [3] Ausiello G., D'Atri A., Protasi M., "structure preserving reductions among convex optimization problems", J. Comput. System Sci., 21 (1980), 136-153. Zbl0441.68049MR589808
- [4] Ausiello G., Crescenzi P., Protasi M., "approximate solutions of NP optimization problems" Technical Report SI/RR-94/03 (1994), Università di Roma "La Sapienza" . Zbl0874.68145MR1357119
- [5] Berge C., graphs and hypergraphs, Amsterdam, North Holland, 1973. Zbl0254.05101MR357172
- [6] Bourjolly J. - M., Hammer P.L., Simeone B., "node-weighted graphs having the König-Egervary property", Math. Prog. Study, 22 (1984), 44-63. Zbl0558.05054MR774233
- [7] Demange M., approximation polynomiale de problèmes NP-complets et programmation linéaire: une nouvelle mesure d'approximation et algorithmes, thèse de Doctorat, Université Paris I, 1994.
- [8] Demange M., Grisoni P., Paschos V. Th., "differential approximation algorithms for some combinatorial optimization problems", Cahier Eco & Maths, 94.65 (1994), Université Paris I. Zbl0912.68061
- [9] Demange M., Paschos V. Th., "on an approximation measure founded on the links between optimization and polynomial approximation theory", Theoretical Comp. Sci., à à paraître. Zbl0871.90069
- [10] Demange M., Paschos V. Th., "the approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems", Computational Optimization and Applications, à paraître. Zbl0872.90106
- [11] Demange M., Paschos V. Th., "exact and approximation results on maximum independent set and minimum vertex covering - graphs with great stability number" , Cahier Eco & Maths, 94.68 (1994), Université Paris I.
- [12] R.W. Deming, "Independence Numbers of Graphs - An Extension of the König-Egervary Theorem",Discrete Maths27, pp. 23-33, 1979. Zbl0404.05034MR534950
- [13] Garey M.R., Johnson D.S., computers and intractability : a guide to the theory of NP-completeness, San Francisco, Freeman and Company, 1979. Zbl0411.68039MR519066
- [14] Lund C., Yannakakis M., "on the hardness of approximating minimization problems", preprint AT&T Bell Laboratories (1992). Zbl1310.68094MR1371491
- [15] Vavasis S.A., "approximation algorithms for indefinite quadratic programming", Math. Programming, 57 (1992), 279-311. Zbl0845.90095MR1195028
- [16] Zemel E., "functions for measuring the quality of approximate solutions to zero-one programming problems" Discussion Paper (1978), Graduate School of Management, North-western University, Evanston, Illinois.
Citations in EuDML Documents
top- Marc Demange, Vangelis Th. Paschos, Asymptotic differential approximation ratio : definitions, motivations and application to some combinatorial problems
- Marc Demange, Vangelis Paschos, Autour de nouvelles notions pour l’analyse des algorithmes d’approximation : formalisme unifié et classes d’approximation
- Marc Demange, Vangelis Paschos, Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances
- Marc Demange, Vangelis Paschos, Autour de nouvelles notions pour l’analyse des algorithmes d’approximation : de la structure de NPO à la structure des instances