Approximability of the subset sum reconfiguration problem (Q489711): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-012-9562-z
+Normal rank
@@ Property / OpenAlex ID @@
+W1978916761
@@ Property / OpenAlex ID: W1978916761 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4260373
@@ Property / cites work: Q4260373 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2857338
@@ Property / cites work: Q2857338 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Rerouting Shortest Paths
@@ Property / cites work: The Complexity of Rerouting Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
+Normal rank
@@ Property / cites work @@
+On Bin Packing with Conflicts
@@ Property / cites work: On Bin Packing with Conflicts / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
+Normal rank
@@ Property / cites work @@
+Q3395518
@@ Property / cites work: Q3395518 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximability of the Subset Sum Reconfiguration Problem
+Normal rank
@@ Property / cites work @@
+On the complexity of reconfiguration problems
@@ Property / cites work: On the complexity of reconfiguration problems / rank @@
+Normal rank
@@ Property / cites work @@
+Reconfiguration of list edge-colorings in a graph
@@ Property / cites work: Reconfiguration of list edge-colorings in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest paths between shortest paths
@@ Property / cites work: Shortest paths between shortest paths / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of independent set reconfigurability problems
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Boolean connectivity problem for Horn relations
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the Boolean connectivity problem for \(k\)-CNF
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+The Knapsack Problem with Conflict Graphs
@@ Property / cites work: The Knapsack Problem with Conflict Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank