On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (Q464901): Difference between revisions

@@ Property / cites work @@
+Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
+Normal rank
@@ Property / cites work @@
+Q2867366
@@ Property / cites work: Q2867366 / rank @@
+Normal rank
@@ Property / cites work @@
+Reoptimizing the traveling salesman problem
@@ Property / cites work: Reoptimizing the traveling salesman problem / rank @@
+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 @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights
+Normal rank
@@ Property / cites work @@
+Non deterministic polynomial optimization problems and their approximations
+Normal rank
@@ Property / cites work @@
+Complexity of Scheduling under Precedence Constraints
+Normal rank