Reoptimization of maximum weight induced hereditary subgraph problems (Q386899): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2012.10.037
+Normal rank
@@ Property / OpenAlex ID @@
+W2085587857
@@ Property / OpenAlex ID: W2085587857 / 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 @@
+Reoptimizing the 0-1 knapsack problem
@@ Property / cites work: Reoptimizing the 0-1 knapsack problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
+Normal rank
@@ Property / cites work @@
+Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights
+Normal rank
@@ Property / cites work @@
+Reoptimization of Steiner Trees
@@ Property / cites work: Reoptimization of Steiner Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Reoptimization of the shortest common superstring problem
+Normal rank
@@ Property / cites work @@
+Reoptimization of Weighted Graph and Covering Problems
+Normal rank
@@ Property / cites work @@
+Q3079180
@@ Property / cites work: Q3079180 / rank @@
+Normal rank
@@ Property / cites work @@
+Reoptimization of Steiner trees: changing the terminal set
+Normal rank
@@ Property / cites work @@
+On the Hardness of Reoptimization
@@ Property / cites work: On the Hardness of Reoptimization / rank @@
+Normal rank
@@ Property / cites work @@
+Reoptimization of the metric deadline TSP
@@ Property / cites work: Reoptimization of the metric deadline TSP / rank @@
+Normal rank
@@ Property / cites work @@
+The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality
+Normal rank
@@ Property / cites work @@
+Knowing All Optimal Solutions Does Not Help for TSP Reoptimization
+Normal rank
@@ Property / cites work @@
+On the Hardness of Reoptimization with Multiple Given Solutions
+Normal rank
@@ Property / cites work @@
+Approximating maximum independent sets by excluding subgraphs
+Normal rank
@@ Property / cites work @@
+Fast reoptimization for the minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Q2867366
@@ Property / cites work: Q2867366 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Maximum Clique by Removing Subgraphs
+Normal rank
@@ Property / cites work @@
+Maintaining minimum spanning trees in dynamic graphs
+Normal rank
@@ Property / cites work @@
+Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+The approximation of maximum subgraph problems
@@ Property / cites work: The approximation of maximum subgraph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling with forbidden sets
@@ Property / cites work: Scheduling with forbidden sets / rank @@
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+Normal rank
@@ Property / cites work @@
+On finite affine line transitive planes
@@ Property / cites work: On finite affine line transitive planes / rank @@
+Normal rank
@@ Property / cites work @@
+Linear degree extractors and the inapproximability of max clique and chromatic number
+Normal rank
@@ Property / cites work @@
+New Reoptimization Techniques applied to Steiner Tree Problem
+Normal rank