Approximating the least hypervolume contributor: NP-hard in general, but fast in practice (Q418034): Difference between revisions

@@ Property / cites work @@
+Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects
+Normal rank
@@ Property / cites work @@
+Approximating the volume of unions and intersections of high-dimensional geometric objects
+Normal rank
@@ Property / cites work @@
+Don't be greedy when calculating hypervolume contributions
+Normal rank
@@ Property / cites work @@
+Evolutionary Multi-Criterion Optimization
@@ Property / cites work: Evolutionary Multi-Criterion Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps?
+Normal rank
@@ Property / cites work @@
+A note on a method for generating points uniformly on             <i>n</i>             -dimensional spheres
+Normal rank
@@ Property / cites work @@
+New Upper Bounds in Klee’s Measure Problem
@@ Property / cites work: New Upper Bounds in Klee’s Measure Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5287558
@@ Property / cites work: Q5287558 / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximate reasoning
@@ Property / cites work: On the hardness of approximate reasoning / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank