Complexity and in-approximability of a selection problem in robust optimization (Q385465): Difference between revisions

@@ Property / DOI @@
-.1007/s10288-012-0227-7
@@ Property / DOI: 10.1007/s10288-012-0227-7 / rank @@
-Normal rank
@@ Property / author @@
+Vladimir G. Deǐneko
@@ Property / author: Vladimir G. Deǐneko / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10288-012-0227-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2029243025
@@ Property / OpenAlex ID: W2029243025 / rank @@
+Normal rank
@@ Property / cites work @@
+Min-max and min-max regret versions of combinatorial optimization problems: A survey
+Normal rank
@@ Property / cites work @@
+Min-max and min-max (relative) regret approaches to representatives selection problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and its applications
@@ Property / cites work: Robust discrete optimization and its applications / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10288-012-0227-7
@@ Property / DOI: 10.1007/S10288-012-0227-7 / rank @@
+Normal rank