(1) assign every zone and sensor to a control unit such that every unit is connected to at most [<span style="font-variant:small-caps;">UCap</span>]{}sensors and at most [<span style="font-variant:small-caps;">UCap</span>]{}zones. Moreover, (2) if a sensor contributes to a zone, it must be placed on the same or on a connected unit (partner unit). However, every unit can be a partner of at most [<span style="font-variant:small-caps;">IUCap</span>]{}other units.

#### Heuristics.

For our evaluation we selected the [<span style="font-variant:small-caps;">Quick[PUP]{}</span>]{}heuristic and its derivatives, since search algorithms using these heuristics were able to outperform best ASP solvers.

-   [<span style="font-variant:small-caps;">Quick[PUP]{}</span>]{} [@DBLP:conf/iaai/TeppanFF12] generates an order of zones and sensors in the first step by selecting some zone as a root and traversing the input zone-sensor relations breadth-first. Then, a depth-first search selects the next unassigned zone or sensor in the order and assigns it to a new unit. If the assignment cannot be done due to a violation of requirement (2), then the already used units are tested starting from the last created one. In case [<span style="font-variant:small-caps;">Quick[PUP]{}</span>]{}is not able to assign a zone or sensor to any unit it unrolls the last made assignment and tries another possibility. Finally, if no more assignments are possible, [<span style="font-variant:small-caps;">Quick[PUP]{}</span>]{}falls back to 