A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem (Q996823): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-006-9024-6
+Normal rank
@@ Property / OpenAlex ID @@
+W1974900495
@@ Property / OpenAlex ID: W1974900495 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4829009
@@ Property / cites work: Q4829009 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Pattern Matching
@@ Property / cites work: Combinatorial Pattern Matching / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Trapezoid graphs and generalizations, geometry and algorithms
+Normal rank
@@ Property / cites work @@
+On the computational complexity of 2-interval pattern matching problems
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank