Suchergebnisse - "polynomial time \(\rho\)-approximation algorithm"

The Approximability Behaviour of Some Combinatorial Problems with Respect to the Approximability of a Class of Maximum Independent Set Problems: The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems

Autoren: Demange, Marc Paschos, Vangelis Université Paris 1 et al.

Weitere Verfasser: Demange, Marc Paschos, Vangelis Université Paris 1 et al.

Quelle: Computational Optimization and Applications. 7:307-324

Schlagwörter: Convex programming, Combinatorial optimization, polynomial time approximation algorithm, 0211 other engineering and technologies, quadratic programming, 02 engineering and technology, Programming involving graphs or networks, Quadratic programming, independent set, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), NP-complete problem, vertex covering, quadratic programming as subproblem, polynomial time \(\rho\)-approximation algorithm, Abstract computational complexity for mathematical programming problems, Recherche opérationnelle

Dateibeschreibung: application/xml

Zugangs-URL: https://basepub.dauphine.fr/handle/123456789/2774
https://rd.springer.com/article/10.1023/A%3A1008660812834
https://dblp.uni-trier.de/db/journals/coap/coap7.html#DemangeP97
https://link.springer.com/article/10.1023%2FA%3A1008660812834

the approximability behaviour of some combinatorial problems with respectto the approximability of a class of maximum independent set problems: The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems

Autoren: Demange, Marc Paschos, Vangelis Université Paris 1 et al.

Weitere Verfasser: Demange, Marc Paschos, Vangelis Université Paris 1 et al.

Quelle: Computational Optimization and Applications. 7(3):307-324

Schlagwörter: Convex programming, Combinatorial optimization, polynomial time approximation algorithm, quadratic programming, Programming involving graphs or networks, Quadratic programming, independent set, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), NP-complete problem, vertex covering, quadratic programming as subproblem, polynomial time \(\rho\)-approximation algorithm, Abstract computational complexity for mathematical programming problems, Recherche opérationnelle

Dateibeschreibung: application/xml

Zugangs-URL: https://basepub.dauphine.fr/handle/123456789/2774
https://rd.springer.com/article/10.1023/A%3A1008660812834
https://dblp.uni-trier.de/db/journals/coap/coap7.html#DemangeP97
https://link.springer.com/article/10.1023%2FA%3A1008660812834