Approximation of min-max and min-max regret versions of some combinatorial optimization problems (Q858438): Difference between revisions

@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact arborescences, matchings and cycles
@@ Property / cites work: Exact arborescences, matchings and cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Multiobjective Knapsack Problems
@@ Property / cites work: Approximating Multiobjective Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and its applications
@@ Property / cites work: Robust discrete optimization and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501853
@@ Property / cites work: Q5501853 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Problems: Reductibility and Approximation
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank