Learn More
The chromatic art gallery problem asks for the minimum number of " colors " t so that a collection of point guards, each assigned one of the t colors, can see the entire polygon subject to some conditions on the colors visible to each point. In this paper, we explore this problem for orthogonal polygons using orthogonal visibility—two points p and q are(More)
We address recently proposed chromatic versions of the classic Art Gallery Problem. Assume a simple polygon P is guarded by a finite set of point guards and each guard is assigned one of t colors. Such a chromatic guarding is said to be conflict-free if each point p ∈ P sees at least one guard with a unique color among all guards visible from p. The goal is(More)
Sending a message through an unknown network is a difficult problem. In this paper, we consider the case in which, during a preprocessing phase, we assign a label and a routing table to each node. The routing strategy must then decide where to send the package using only the label of the target node and the routing table of the node the message is currently(More)
This study examined whether social support and particular coping strategies were associated with self-reported depression, anxiety, anger, and physical symptoms in spouses of terminally ill patients recently admitted to a hospice program. Forty-four spouses were assessed within two weeks of the patients' admission. Results showed that specific types of(More)
  • 1