Bringing Order to Special Cases of Klee’s Measure Problem

DOI10.1007/978-3-642-40313-2_20zbMath1400.68082arXiv1301.7154OpenAlexW1569766464MaRDI QIDQ2849910

Karl Bringmann

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.7154

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Efficient computation of the search region in multi-objective optimization ⋮ Computing the depth distribution of a set of boxes

This page was built for publication: Bringing Order to Special Cases of Klee’s Measure Problem