Bringing order to special cases of Klee's measure problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8087 LNCS, Issue , 2013, Pages 207-218

  Bringmann, Karl ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EXPONENTIAL TIME HYPOTHESIS; HYPERVOLUME; KLEE'S MEASURE PROBLEM; LOWER BOUNDS; NON-TRIVIAL; RUNTIMES; SIDE LENGTH;

COMPUTER SCIENCE; GEOMETRY;

ALGORITHMS;

EID: 84885197346     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40313-2_20     Document Type: Conference Paper

References (21)

1. Agarwal, P.K.: An improved algorithm for computing the volume of the union of cubes. In: Proc. 2010 Annual Symposium on Computational Geometry (SoCG 2010), pp. 230-239. ACM, New York (2010)
2. Bentley, J.L.: Algorithms for Klee's rectangle problems. Department of Computer Science, Carnegie Mellon University (1977) (unpublished notes)
3. Beume, N., Naujoks, B., Emmerich, M.T.M.: SMS-EMOA: Multiobjective selection based on dominated hypervolume. European Journal of Operational Research 181, 1653-1669 (2007)
4. Beume, N., Fonseca, C.M., López-Ibáñez, M., Paquete, L., Vahrenhold, J.: On the complexity of computing the hypervolume indicator. IEEE Trans. Evolutionary Computation 13, 1075-1082 (2009)
5. Boissonnat, J.-D., Sharir, M., Tagansky, B., Yvinec, M.: Voronoi diagrams in higher dimensions under certain polyhedral distance functions. Discrete & Computational Geometry 19, 485-519 (1998)
6. Bringmann, K.: An improved algorithm for Klee's measure problem on fat boxes. Computational Geometry: Theory and Applications 45, 225-233 (2012)
7. Bringmann, K.: Bringing order to special cases of Klee's measure problem. CoRR, abs/1301.7154 (2013)
8. Bringmann, K., Friedrich, T.: Approximating the least hypervolume contributor: NP-hard in general, but fast in practice. Theoretical Computer Science 425, 104-116 (2012)
9. Chan, T.M.: Semi-online maintenance of geometric optima and measures. SIAM J. Comput. 32, 700-716 (2003)
10. Chan, T.M.: A (slightly) faster algorithm for Klee's measure problem. Computational Geometry: Theory and Applications 43, 243-250 (2010)
11. i]. Commun. ACM 21, 540-544 (1978)
12. Guerreiro, A.P., Fonseca, C.M., Emmerich, M.T.M.: A fast dimension-sweep algorithm for the hypervolume indicator in four dimensions. In: Proc. 24th Canadian Conference on Computational Geometry (CCCG 2012), pp. 77-82 (2012)
13. Igel, C., Hansen, N., Roth, S.: Covariance matrix adaptation for multi-objective optimization. Evolutionary Computation 15, 1-28 (2007)
14. Kaplan, H., Rubin, N., Sharir, M., Verbin, E.: Counting colors in boxes. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 785-794 (2007)
15. i] be computed in less than O (n log n) steps? American Mathematical Monthly 84, 284-285 (1977)
16. Lokshtanov, D., Marx, D., Saurabh, S.: Lower bounds based on the exponential time hypothesis, The Complexity Column by V. Arvind. Bulletin of the EATCS 105, 41-72 (2011)
17. Overmars, M.H., Yap, C.-K.: New upper bounds in Klee's measure problem. SIAM J. Comput. 20, 1034-1045 (1991)
18. van Leeuwen, J., Wood, D.: The measure problem for rectangular ranges in d-space. J. Algorithms 2, 282-300 (1981)
19. Yildiz, H., Suri, S.: On Klee's measure problem for grounded boxes. In: Proc. 2012 Annual Symposuim on Computational Geometry (SoCG 2012), pp. 111-120. ACM, New York (2012)
20. Zitzler, E., Künzli, S.: Indicator-based selection in multiobjective search. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 832-842. Springer, Heidelberg (2004)
21. Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach. IEEE Trans. Evolutionary Computation 3, 257-271 (1999)