Approximating the 2-interval pattern problem-Reference-Cited by-同舟云学术

Approximating the 2-interval pattern problem

Published:2008-05 Issue:2-3 Volume:395 Page:283-297
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Crochemore Maxime,Hermelin Danny,Landau Gad M.,Rawitz Dror,Vialette Stéphane

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference21 articles.

1. Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots;Akutsu;Discrete Applied Mathematics,2000

2. A unified approach to approximating resource allocation and schedualing;Bar-Noy;Journal of the ACM,2001

3. One for the price of two: A unified approach for approximating covering problems;Bar-Yehuda;Algorithmica,2000

4. A local-ratio theorem for approximating the weighted vertex cover problem;Bar-Yehuda;Annals of Discrete Mathematics,1985

5. R. Bar-Yehuda, M.M. Halldorsson, J. Naor, H. Shachnai, I. Shapira, Scheduling split intervals, in: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002, pp. 732–741

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parameterized complexity of two-interval pattern problem;Theoretical Computer Science;2022-01

2. Low Diameter Algebraic Graphs;Trends in Mathematics;2021

3. An Introduction to Intersection Graphs;Handbook of Research on Advanced Applications of Graph Theory in Modern Society;2020

4. Two-Interval Pattern Problems;Encyclopedia of Algorithms;2016

5. Fast Algorithms for Local Similarity Queries in Two Sequences;International Journal of Foundations of Computer Science;2015-08