Table of Contents
ISRN Electronics
Volume 2012, Article ID 859820, 10 pages
Research Article

Polynomial Time Instances for the IKHO Problem

1Department of Computer Science, University of Verona, 37134 Verona, Italy
2Department of Information Engineering and Computer Science, University of Trento, 38123 Povo, Italy

Received 20 January 2012; Accepted 7 February 2012

Academic Editors: C. W. Chiou and T. L. Kunii

Copyright © 2012 Romeo Rizzi and Luca Nardin. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. Isto Aho, “Interactive Knapsacks,” Fundamenta Informaticae, vol. 44, no. 1-2, pp. 1–23, 2000. View at Google Scholar
  2. Isto Aho, “On the approximability of interactive knapsacks problems,” in Proceedings of the 28th Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM '01), vol. 2234 of Lecture Notes in Computer Science, pp. 152–159, Piešt’any, Slovak Republic, November/December 2001. View at Publisher · View at Google Scholar
  3. Isto Aho, “New polynomial-time instances to various knapsack-type problems,” Fundamenta Informaticae, vol. 53, no. 3-4, pp. 199–228, 2002. View at Google Scholar · View at Scopus
  4. Isto Aho, Interactive Knapsacks: Theory and Application, A-2002-13, University of Tampere, 2002.
  5. E. Y.-H. Lin, “A bibliographical survey on some well-known non-standard knapsack problems,” INFOR, vol. 36, no. 4, pp. 274–317, 1998. View at Google Scholar · View at Scopus
  6. D. S. Hirschberg, “Algorithms for the longest common subsequence problem,” Journal of the ACM, vol. 24, no. 4, pp. 664–675, 1977. View at Publisher · View at Google Scholar
  7. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge University Press, Cambridge, UK, 1997.