The checkpoint problem (Q714790): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2012.05.021
+Normal rank
@@ Property / OpenAlex ID @@
+W2002766600
@@ Property / OpenAlex ID: W2002766600 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation for directed cut problems
@@ Property / cites work: Improved approximation for directed cut problems / rank @@
+Normal rank
@@ Property / cites work @@
+The hardness of approximate optima in lattices, codes, and systems of linear equations
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / rank @@
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating Multicut and Sparsest-Cut
+Normal rank
@@ Property / cites work @@
+Approximating directed multicuts
@@ Property / cites work: Approximating directed multicuts / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial flow-cut gaps and hardness of directed cut problems
+Normal rank
@@ Property / cites work @@
+Combination Can Be Hard: Approximability of the Unique Coverage Problem
+Normal rank
@@ Property / cites work @@
+The importance of being biased
@@ Property / cites work: The importance of being biased / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Paths and Cycles of Superpolylogarithmic Length
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for integral flow and multicut in trees
+Normal rank
@@ Property / cites work @@
+Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
+Normal rank
@@ Property / cites work @@
+Approximating the <i>k</i>-multicut problem
@@ Property / cites work: Approximating the <i>k</i>-multicut problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471328
@@ Property / cites work: Q4471328 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of paths avoiding forbidden pairs
+Normal rank
@@ Property / cites work @@
+Greedy approximation algorithms for directed multicuts
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating spanners
@@ Property / cites work: On the hardness of approximating spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+Partial multicuts in trees
@@ Property / cites work: Partial multicuts in trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4910703
@@ Property / cites work: Q4910703 / rank @@
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem with Distances One and Two
+Normal rank
@@ Property / cites work @@
+Q3549709
@@ Property / cites work: Q3549709 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Impossible pair constrained test path generation in a program
+Normal rank
@@ Property / cites work @@
+Q5501283
@@ Property / cites work: Q5501283 / rank @@
+Normal rank
@@ Property / cites work @@
+On paths avoding forbidden pairs of vertices in a graph
+Normal rank