Abstract
Min Storage is an NP–hard optimization problem that arises in a natural way when one considers computations in which the amount of energy provided with the input values is preserved during the computation. In this paper we propose a polynomial time membrane algorithm that computes approximate solutions to the instances of Min Storage, and we study its behavior on (almost) uniformly randomly chosen instances. Moreover, we compare the (estimated) coefficient of approximation of this algorithm with the ones obtained from several other polynomial time heuristics. The result of this comparison indicates the superiority of the membrane algorithm with respect to many other traditional approximation techniques.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti–Spaccamela, A., Protasi, M.: Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)
Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory on NP–Completeness. W.H. Freeman and Company, New York (1979)
Gens, G.V., Levner, E.V.: Computational complexity of approximation algorithms for combinatorial problems. In: Becvar, J. (ed.) MFCS 1979. LNCS, vol. 74, pp. 292–300. Springer, Heidelberg (1979)
Goldberg, D.E., Lingle, R.: Alleles, Loci and the Traveling Salesman Problem. In: Proceedings of the International Conference on Genetic Algorithms, pp. 154–159 (1985)
Leporati, A., Zandron, C., Mauri, G.: Conservative Computations in Energy–Based P Systems. In: Mauri, G., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 344–358. Springer, Heidelberg (2005)
Nishida, T.Y.: Membrane algorithms. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol. 3850, pp. 55–66. Springer, Heidelberg (2006)
Păun, G.: Computing with membranes. Journal of Computer and System Sciences 1(61), 108–143 (2000); See also Turku Centre for Computer Science — TUCS Report No. 208 (1998)
Păun, G.: Computing with Membranes. An Introduction. Bulletin of the EATCS 67, 139–152 (1999)
Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)
Păun, G., Rozenberg, G.: A Guide to Membrane Computing. Theoretical Computer Science 287(1), 73–100 (2002)
The P systems Web page: http://psystems.disco.unimib.it/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leporati, A., Pagani, D. (2006). A Membrane Algorithm for the Min Storage Problem. In: Hoogeboom, H.J., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2006. Lecture Notes in Computer Science, vol 4361. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11963516_28
Download citation
DOI: https://doi.org/10.1007/11963516_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69088-7
Online ISBN: 978-3-540-69090-0
eBook Packages: Computer ScienceComputer Science (R0)