SciELO - Scientific Electronic Library Online

 
vol.13 issue1Teaching safety precautions in a laboratory DVE: the effects of information location and interactivity author indexsubject indexsearch form
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • Have no similar articlesSimilars in SciELO

Share


Computación y Sistemas

Print version ISSN 1405-5546

Abstract

RUIZ-VANOYE, Jorge A.; PEREZ ORTEGA, Joaquín  and  PAZOS RANGEL, Rodolfo A.. Development of Instance Indicators Applicable to Algorithm Selection for the 2-Partition Problem. Comp. y Sist. [online]. 2009, vol.13, n.1, pp.111-119. ISSN 1405-5546.

In this work we approach the problem of transforming instances and complexity indicators between the problems discovered being Bin-Packing and 2-Partition. Several researchers have reductions and polynomial transformations between NP-complete problems, the main ones Garey & Johnson, Karp and Cook. The transformation of 2-Partition into Bin-Packing exists in literature. Nevertheless, does not exist the transformation of Bin-Packing into 2-Partition, nor the transformation of indicators with the purpose of to be used in the selection of algorithms that better solves an instance of the 2-Partition problem. In this thesis a new approach of solution is proposed to transform instances, to develop complexity indicators and to solve the Bin-Packing problem to the 2-Partition problem, by means of a methodology and formal languages to express the instances of both problems.

Keywords : Polynomial transformation; formal languages of instances; compilers, NP-Complete; algorithm selection.

        · abstract in Spanish     · text in Spanish     · Spanish ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License