Paradigms of Combinatorial Optimization

Paradigms of Combinatorial Optimization

4.11 - 1251 ratings - Source

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aims to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. a€œParadigms of Combinatorial Optimizationa€ is divided in two parts: a€c Paradigmatic Problems, that handles several famous combinatorial optimization problems as max cut, min coloring, optimal satisfiability tsp, etc., the study of which has largely contributed to both the development, the legitimization and the establishment of the Combinatorial Optimization as one of the most active actual scientific domains; a€c Classical and New Approaches, that presents the several methodological approaches that fertilize and are fertilized by Combinatorial optimization such as: Polynomial Approximation, Online Computation, Robustness, etc., and, more recently, Algorithmic Game Theory.Most of the reductions presented in this chapter have been conceived with the aim of revealing complete problems for diverse approximability classes, principally for APX, but they do not manage to capture the transfer of the approximability (oranbsp;...

Title:Paradigms of Combinatorial Optimization
Author:Vangelis Th. Paschos
Publisher:John Wiley & Sons - 2013-05-06


You Must CONTINUE and create a free account to access unlimited downloads & streaming