Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

EUROCAST

2005

Springer

2005

Springer

abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity notions, we started deﬁning two categories: the OPTS category of polynomial time soluble optimization problems, which morphisms are reductions, and the OPT category of optimization problems, having approximationpreserving reductions as morphisms. The study of approximation implies to create means of comparing optimization problems. The basic idea of approximation by models is a recurrent one in mathematics and in this direction a comparison mechanism between the OPTS and OPT categories has been introduced in [5]. In order to establish a formal ground for the study of the approximation properties of optimization problems, a system approximation to each optimization problem is constructed, based on categorical shape theory. In so doing, we were very much inspired in previous works ∗This work is partially sup...

Related Content

Added |
27 Jun 2010 |

Updated |
27 Jun 2010 |

Type |
Conference |

Year |
2005 |

Where |
EUROCAST |

Authors |
Liara Aparecida dos Santos Leal, Dalcidio Moraes Claudio, Laira Vieira Toscani, Paulo Blauth Menezes |

Comments (0)