This paper introduces relaxed abduction, a novel non-standard reasoning task for description logics. Although abductive reasoning over description logic knowledge bases has been applied successfully to various information interpretation tasks, it typically fails to provide adequate (or even any) results when confronted with spurious information or incomplete models. Relaxed abduction addresses this flaw by ignoring such pieces of information automatically based on a joint optimization of the sets of explained observations and required assumptions. We present a method to solve relaxed abduction over EL+ TBoxes based on the notion of multi-criterion shortest hyperpaths.