The network-untangling problem: from interactions to activity timelines (Q2659278): Difference between revisions

@@ Property / cites work @@
+A linear-time algorithm for testing the truth of certain quantified Boolean formulas
+Normal rank
@@ Property / cites work @@
+On the approximation of curves by line segments using dynamic programming
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3673102
@@ Property / cites work: Q3673102 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3948568
@@ Property / cites work: Q3948568 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup>
+Normal rank
@@ Property / cites work @@
+The Structure and Function of Complex Networks
@@ Property / cites work: The Structure and Function of Complex Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Strongly polynomial efficient approximation scheme for segmentation
+Normal rank