In hyperconvex metric spaces, we first present a coincidence point theorem for condensing set-valued self-maps. Then we consider the best approximation problem and the best proximity problem for set-valued mappings that are condensing. As an application, we derive a coincidence point theorem for nonself-condensing set-valued maps.