Titlebook: Structural Information and Communication Complexity; 19th International C Guy Even,Magnús M. Halldórsson Conference proceedings 2012 Spring

肥料

使服水土

https://doi.org/10.1007/978-3-642-31104-8anonymous networks; distributed algorithms; graph theory; mobile networks; wireless networks; algorithm a

Spinous-Process

敲詐

Commonwealth

penance

harbinger

允許

The Fault Tolerant Capacitated ,-Center Problem,ers, where each service center has a limited service capacity and thus may be assigned at most . clients, so as to minimize the maximum distance from a vertex to its assigned service center. This paper studies the fault tolerant version of this problem, where one or more service centers might fail s

AUGER

GROSS

Changing of the Guards: Strip Cover with Duty Cycling, into . that take turns covering the region in question, and each sensor can belong to at most one shift. We consider the imposition of the duty cycling model upon the . problem, where we are given . sensors on a one-dimensional region, and each shift can contain at most .?≤?. sensors. We call the p