On the approximability of minmax (regret) network optimization problems (Q976089): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2008.10.008
@@ Property / DOI: 10.1016/j.ipl.2008.10.008 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
-W2006806110
@@ Property / OpenAlex ID: W2006806110 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2006806110
@@ Property / OpenAlex ID: W2006806110 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0396
@@ Property / arXiv ID: 0804.0396 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Min-Max (Regret) Versions of Some Polynomial Problems
+Normal rank
@@ Property / cites work @@
+Approximation of min-max and min-max regret versions of some combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Complexity of the min-max and min-max regret assignment problems
+Normal rank
@@ Property / cites work @@
+On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
+Normal rank
@@ Property / cites work @@
+On the complexity of the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+The hardness of approximate optima in lattices, codes, and systems of linear equations
+Normal rank
@@ Property / cites work @@
+On the complexity of a class of combinatorial optimization problems with uncertainty
+Normal rank
@@ Property / cites work @@
+Interval data minmax regret network optimization problems
+Normal rank
@@ Property / cites work @@
+On the complexity of minmax regret linear programming
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for interval data minmax regret combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
+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 @@
+Q4130999
@@ Property / cites work: Q4130999 / rank @@
+Normal rank
@@ Property / cites work @@
+The Recognition of Series Parallel Digraphs
@@ Property / cites work: The Recognition of Series Parallel Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of the relative robust shortest path problem with interval data
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2008.10.008
@@ Property / DOI: 10.1016/J.IPL.2008.10.008 / rank @@
+Normal rank