The Homogeneous Broadcast Problem in Narrow and Wide Strips

Let $P$ be a set of nodes in a wireless network, where each node is modeled as a point in the plane, and let $s\in P$ be a given source node. Each node $p$ can transmit information to all other nodes within unit distance, provided $p$ is activated. The (homogeneous) broadcast problem is to activate a minimum number of nodes such that in the resulting directed communication graph, the source $s$ can reach any other node. We study the complexity of the regular and the hop-bounded version of the problem (in the latter, $s$ must be able to reach every node within a specified number of hops), with the restriction that all points lie inside a strip of width $w$. We almost completely characterize the complexity of both the regular and the hop-bounded versions as a function of the strip width $w$.


Introduction
Wireless networks give rise to a host of interesting algorithmic problems.In the traditional model of a wireless network each node is modeled as a point p ∈ R 2 , which is the center of a disk δ(p) whose radius equals the transmission range of p. Thus p can send a message to another node q if and only if q ∈ δ(p).Using a larger transmission radius may allow a node to transmit to more nodes, but it requires more power and is more expensive.This leads to so-called rangeassignment problems, where the goal is to assign a transmission range to each node such that the resulting communication graph has desirable properties, while minimizing the cost of the assignment.We are interested in broadcast problems, where the desired property is that a given source node can reach any other node in the communication graph.Next, we define the problem more formally.
Let P be a set of n points in R d and let s ∈ P be a source node.A range assignment is a function ρ : P → R 0 that assigns a transmission range ρ(p) to each point p ∈ P .Let G ρ = (P, E ρ ) be the directed graph where (p, q) ∈ E ρ iff |pq| ρ(p).The function ρ is a broadcast assignment if every point p ∈ P is reachable from s in G ρ .If every p ∈ P is reachable within h hops, for a given parameter h, then ρ is an h-hop broadcast assignment.The (h-hop) broadcast problem is to find an (h-hop) broadcast assignment whose cost p∈P cost(ρ(p)) is minimized.Often the cost of assigning transmission radius x is defined as cost(x) = x α for some constant α.In R 1 , both the basic broadcast problem and the h-hop version are solvable in O(n 2 ) time [9].In R 2 the problem is NP-hard for any α > 1 [7,13], and in R 3 it is even APX-hard [13].There are also several approximation algorithms [1,7].For the 2-hop broadcast problem in R 2 an O(n 7 ) algorithm is known [2] and for any constant h there is a PTAS [2].Interestingly, the complexity of the 3-hop broadcast problem is unknown.
An important special case of the broadcast problem is where we allow only two possible transmission ranges for the points, ρ(p) = 1 or ρ(p) = 0.In this case the exact cost function is irrelevant and the problem becomes to minimize the number of active points.This is called the homogeneous broadcast problem and it is the version we focus on.From now on, all mentions of broadcast and h-hop broadcast refer to the homogeneous setting.Observe that if ρ(p) = 1 then (p, q) is an edge in G ρ if and only if the disks of radius 1/2 centered at p and q intersect.Hence, if all points are active then G ρ in the intersection graph of a set of congruent disks or, in other words, a unit-disk graph (UDG).Because of their relation to wireless networks, UDGs have been studied extensively.
Let D be a set of congruent disks in the plane, and let G D be the UDG induced by D. A broadcast tree on G D is a rooted spanning tree of G D .To send a message from the root to all other nodes, each internal node of the tree has to send the message to its children.Hence, the cost of broadcasting is related to the internal nodes in the broadcast tree.A cheapest broadcast tree corresponds to a minimum-size connected dominating set on G D , that is, a minimum-size subset ∆ ⊂ D such that the subgraph induced by ∆ is connected and each node in G D is either in ∆ or a neighbor of a node in ∆.The broadcast problem is thus equivalent to the following: given a UDG G D with a designated source node s, compute a minimum-size connected dominated set ∆ ⊂ D such that s ∈ ∆.
In the following we denote the dominating set problem by ds, the connected dominating set problem by cds, and we denote these problems on UDGs by dsudg and cds-udg, respectively.Given an algorithm for the broadcast problem, one can solve cds-udg by running the algorithm n times, once for each possible source point.Consequently, hardness results for cds-udg can be transferred to the broadcast problem, and algorithms for the broadcast problem can be transferred to cds-udg at the cost of an extra linear factor in the running time.It is well known that ds and cds are NP-hard, even for planar graphs [14].dsudg and cds-udg are also NP-hard [16,19].The parameterized complexity of ds-udg has also been investigated: Marx [17] proved that ds-udg is W [1]-hard when parameterized by the size of the dominating set.(The definition of W [1] and other parameterized complexity classes can be found in the book by Flum and Grohe [12].) Our contributions.Knowing the existing hardness results for the broadcast problem, we set out to investigate the following questions.Is there a natural special case or parameterization admitting an efficient algorithm?Since the broadcast problem is polynomially solvable in R 1 , we study how the complexity of the problem changes as we go from the 1-dimensional problem to the 2-dimensional problem.To do this, we assume the points (that is, the disk centers) lie in a strip of width w, and we study how the problem complexity changes as we increase w.We give an almost complete characterization of the complexity, both for the general and for the hop-bounded version of the problem.More precisely, our results are as follows.
We first study strips of width at most √ 3/2.Unit disk graphs restricted to such narrow strips are a subclass of co-comparability graphs [20], for which an O(nm) time cds algorithm is known [15,4].(Here m denotes the number of edges in the graph.)The broadcast problem is slightly different because it requires s to be in the dominating set; still, one would expect better running times in this restricted graph class.Indeed, we show that for narrow strips the broadcast problem can be solved in O(n log n) time.The hop condition in the h-hop broadcast problem has not been studied yet for co-comparability graphs to our knowledge.This condition complicates the problem considerably.Nevertheless, we show that the h-hop broadcast problem in narrow strips is solvable in polynomial time.Our algorithm runs in O(n 6 ) and uses a subroutine for 2-hop broadcast, which may be of independent interest: we show that the 2-hop broadcast problem is solvable in O(n 4 ) time.Our subroutine is based on an algorithm by Ambühl et al. [2] for the non-homogeneous case, which runs in O(n 7 ) time.This result is deferred to Appendix A.
Second, we investigate what happens for wider strips.We show that the broadcast problem has an n O(w) dynamic-programming algorithm for strips of width w.We prove a matching lower bound of n Ω(w) , conditional on the Exponential Time Hypothesis (ETH).Interestingly, the h-hop broadcast problem has no such algorithm (unless P = NP): we show this problem is already NP-hard on a strip of width 40.One of the gadgets in this intricate construction can also be used to prove that a cds-udg and the broadcast problem are W [1]-hard parameterized by the solution size k.The W [1]-hardness proof is discussed in Section 4. It is a reduction from Grid Tiling based on ideas by Marx [17], and it implies that there is no f (k)n o( √ k) algorithm for cds-udg unless ETH fails.

Algorithms for broadcasting inside a narrow strip
In this section we present polynomial algorithms (both for broadcast and for h-hop broadcast) for inputs that lie inside a strip S := R × [0, w], where 0 < w √ 3/2 is the width of the strip.Without loss of generality, we assume that the source lies on the y-axis.Define S 0 := [0, ∞)×[0, w] and S 0 := (−∞, 0]×[0, w]. Let P be the set of input points.We define x(p) and y(p) to be the x-and y-coordinate of a point p ∈ P , respectively, and δ(p) to be the unit-radius disk centered at p. Let G = (P, E) be the graph with (p, q) ∈ E iff q ∈ δ(p), and let P := P \ δ(s) be the set of input points outside the source disk.We say that a point p ∈ P is left-covering if pp ∈ E for all p ∈ P with x(p ) < x(p); p is right-covering if p p ∈ E for all p ∈ P with x(p ) > x(p).We denote the set of left-covering and right-covering points by Q − and Q + respectively.Finally, the core area of a point p, denoted by core(p), is [x(p) − 1 2 , x(p) + 1  2 ] × [0, w].Note that core(p) ⊂ δ(p) because w √ 3/2, i.e., the disk of p covers a part of the strip that has horizontal length at least one.This is a key property of strips of width at most √ 3/2, and will be used repeatedly.We partition P into levels L 0 , L 1 , . . .L t , based on hop distance from s in G. Thus L i := {p ∈ P : d G (s, p) = i}, where d G (s, p) denotes the hop-distance.Let L − i and L + i denote the points of L i with negative and nonnegative coordinates, respectively.We will use the following observation multiple times.
Observation 1.Let G = (P, E) be a unit disk graph on a narrow strip S. (i) Let π be a path in G from a point p ∈ P to a point q ∈ P .Then the region [x(p) − 1 2 , x(q) + 1 2 ] × [0, w] is fully covered by the disks of the points in π. (ii) The overlap of neighboring levels is at most Let p be an arbitrary point in L + i for some i > 0. Then the disks of any path π(s, p) cover all points in all levels Proof.For (i), note that for any edge (u, v) ∈ E, we have that core(u) and core(v) intersect.Thus the union of the cores of the points of π is connected, and contains core(p) and core(q).Consequently, it covers [x(p) − 1 2 , x(q) + 1 2 ] × [0, w].We prove (ii) by contradiction.Suppose that there are p ∈ L i−1 and q ∈ L i with x(p) > x(q)+ 1 2 .Any shortest path π(s, p) must have a point p inside [x(q)− 1 2 , x(q) + 1 2 ] × [0, w], because no edge of the path can jump over this part of the strip.This point p has level at most i − 2 and q ∈ δ(p ), contradicting that q is at level i.

Minimum broadcast set in a narrow strip
A broadcast set is a point set D ⊆ P that gives a feasible broadcast, i.e., a connected dominating set of G that contains s.Our task is to find a minimum broadcast set inside a narrow strip.Let p, p ∈ P be points with maximum and minimum x-coordinate, respectively.Obviously there must be paths from s to p and p in G such that all points on these paths are active, except possibly p and p .If p and p are also active, then these paths alone give us a feasible broadcast set: by Observation 1(i), these paths cover all our input points.Instead of activating p and p , it is also enough to activate the points of a path that reaches Q − and a path that reaches Q + .In most cases it is sufficient to look for broadcast sets with this structure.
Lemma 1.If there is a minimum broadcast set with an active point on L 2 , then there is a minimum broadcast set consisting of the disks of a shortest path π − from s to Q − and a shortest path π + from s to Q + .These two paths share s and they may or may not share their first point after s.Proof.We begin by showing that there is a minimum broadcast that intersects both Q + and Q − .
Claim.There is a minimum broadcast set D containing a point in Q + .
Proof of claim.Let D be a minimum broadcast set.Without loss of generality, we may assume that L + 2 has an active point.It follows that this active point in L + 2 has a descendant leaf a ∈ L + 2 in the broadcast tree (the tree one gets by performing breadth first search from s in the graph spanned by D).Note that δ(a) does not cover any points in S 0 \ δ(s), since a ∈ core(s) and core(s) has width 1.
Suppose that .We call such a replacement a swap operation.This operation results in a new minimum broadcast set, because the size of the set remains the same, and no vertex can become disconnected from the source on either side: the right side remains connected along the broadcast tree, and the left is untouched since δ(a) ∩ S 0 ⊆ δ(s).Repeated swap operations lead to a minimum-size broadcast set D that contains at least one point from Q + .(The procedure terminates since the sum of the x-coordinates of the active points increases.) The resulting minimum broadcast set D contains a path π + from s to Q + .Let a + be the last point on π + that falls in L 1 .Without loss of generality, we can assume that the first two points of π + are s and a + .Let q + = Q + ∩ π + .By part (iii) of Observation 1, the disks around the points of π + cover all points with x coordinates between 0 and x(q + ) + 1 2 ; and q + ∈ Q + implies that it covers all input points with x-coordinate higher than x(q + ) + 1 2 .Consequently, there are no active points in the right part outside this path-that is, no active points in S 0 \ δ(s)∪π + )-since those could be removed while maintaining the feasibility of the solution.
Claim.There is a minimum broadcast set D containing a point in Q + and one in Q − .

Proof of claim.
If there is a disk in D ∩ L − 2 as well, then we can reuse the previous argument for the other side, and get a broadcast set that contains a path π − from s to Q − .Otherwise, we need to be slightly more careful with our swap operations: we need to make sure not to remove a + .If a + ∈ Q − , then we can again use the previous argument: it is possible to find another disk b, and corresponding uniquely covered points ā+ and b (see Fig. 2).Note that b ∈ δ(s) since we are in the case L − 2 = ∅.We argue that b can be replaced with ā+ : removing b can not disconnect anything from s on either side, and δ(ā + ) covers all points covered by δ(b).Repeated swap operations lead to a minimum broadcast set D that contains points from both Q + and Q − .Let π − and a − be defined analogously to how π + and a + were defined above.Note that a + and a − might coincide.Since π + ∪ π − is connected and covers all points, we have D = π + ∪ π − .To finish the proof, it remains to argue that we can take π + and π − to be shortest paths to Q + and Q − .Suppose π + is not a shortest path to Q + .(The argument for π − is similar.)Then we can replace π + ∪ π − by π+ ∪ π − π + is a shortest path from s to Q + .Since π + and π − share at most one point besides s, this replacement does not increase the size of the solution.
Lemma 2 below fully characterizes optimal broadcast sets.To deal with the case where Lemma 1 does not apply, we need some more terminology.We say that the disk δ(q) of an active point q in a feasible broadcast set is bidirectional if there are two input points p − ∈ L − 2 and p + ∈ L + 2 that are covered only by δ(q).See points p and p in Fig. 3 for an example.Note that q ∈ core(s), because core Proof.Let opt be the size of a minimum broadcast set.First consider the case opt 4. By Lemma 1 it suffices to prove that there is an active point in L 2 .If L 3 = ∅ this is trivially true, so assume that L 3 = ∅.Since opt 4, it follows that L + 2 = ∅ otherwise activating the shortest path from s to the point with minimum x-coordinate is a feasible broadcast set of size at most 3. Similarly, then there is a minimum broadcast set with an active point in L 2 : we take s, a point from Q + ∩ L 1 , and a shortest path from s to the leftmost point (at most two more points).Thus we may assume that Q + , and similarly, Let {s, p 1 , p 2 , p 3 } be a subset of a minimum broadcast set.If δ(p i ) is monodirectional, then let pi ∈ L 2 be a point uniquely covered by p i ; suppose that pi ∈ S + (the proof is the same for the left side).Since p i ∈ Q + , there is a point q ∈ L 1 that uniquely covers another point q ∈ L 2 .We can swap p i for q and get the desired outcome.
Therefore, the new broadcast set obtained after the double swap is feasible, and the size remains unchanged, so it is a minimum broadcast set.Notice that a single swap or double swap results in a minimum broadcast set that has an active point in L 2 .
If the minimum broadcast set has size three, containing {δ(s), δ(p 1 ), δ(p 2 )}, then either both δ(p 1 ) and δ(p 2 ) are bidirectional, or at least one of them is monodirectional, so a single swap operation results in a minimum broadcast set with an active disk in L 2 , so there is a path-like minimum broadcast set by Lemma 1.
As it turns out, the bidirectional case is the most difficult one to compute efficiently.(It is similar to cds-udg in co-comparability graphs, where the case of a connected dominating set of size at most 3 dominates the running time.)Consider the computation of Z − (p); the other values can be computed similarly.Let T be a balanced binary tree whose leaves store the points from P − in order of their y-coordinate.For a node ν in T , let F (ν) := {δ(u i ) : u i is stored in the subtree rooted at ν}.We start by computing at each node ν the intersection of the disks in F (ν).More precisely, for each ν we compute the region I(ν) := core(s) ∩ F (ν). Notice that I(ν) is y-monotone and convex, and each disk δ(u i ) contributes at most one arc to ∂I(ν).(Here ∂I(ν) refers to the boundary of I(ν) that falls inside S.) Moreover, I(ν) = I(left-child(ν)) ∩ I(right-child(ν)).Hence, we can compute the regions I(ν) of all nodes ν in T in O(n log n) time in total, in a bottom-up manner.Using the tree T we can now compute Z − (p) for any given p ∈ core(s) by searching in T , as follows.Suppose we arrive at a node ν.If p ∈ I(left-child(ν)), then descend to right-child(ν), otherwise descend to left-child(ν).The search stops when we reach a leaf, storing a point u i .One easily verifies that if p ∈ δ(u i ) then Since I(ν) is a convex region, we can check if p ∈ I(ν) in O(1) time if we can locate the position of p y in the sorted list of y-coordinates of the vertices of ∂I(ν).
We can locate p y in this list in O(log n) time, leading to an overall query time of O(log 2 n).This can be improved to O(log n) using fractional cascading [6].Note that the application of fractional cascading does not increase the preprocessing time of the data structure.We conclude that we can compute all values Z − (p) in O(n log n) time in total.
In order to compute a minimum broadcast, we can first check for small and bidirectional solutions.To find path-like solutions, we first compute the sets Q − and Q + , and compute shortest paths starting from these sets back to the source disk.The path computation is very similar to the shortest path algorithm in UDGs by Cabello and Jejčič [5].[3,11].To compute Q ∩ p∈P δ(p) we proceed similarly, except that we use the farthest-point Voronoi diagram [3].
Lemma 5. We can compute the sets Proof.We show how we can compute Q + , the algorithm for Q − is analogous.Let p be an input point with the highest x-coordinate.Notice that all input points in [x(p) − 1 2 , x(p)] × [0, w] belong to Q + since their core contains all points with higher coordinates.Points in [x(p) − Proof.The algorithm can be stated as follows.It is best to read this pseudocode in parallel with the explanation and analysis below.

Repeat the following until
δ(p) using Lemma 4, and set P := a) Set j := j + 1 and determine T j := {t ∈ P : δ(p) using Lemma 4, and set P := ∅ then report a solution of size i + j + 1, namely the points of a shortest path from s to Q + i and a shortest path from s to Q − j .Otherwise report a solution of size i + j: take an arbitrary point p in Q + i ∩ Q − j , and report s plus a shortest path from p to Q + i and a shortest path from p to Q − j .In order to execute step 1, we first check whether there is a minimum broadcast set of size one or two.This is very easy for size one: we just need to check whether the source disk covers every point or not in O(n) time.For size two, we can compute the intersection of all disks centered outside δ(s), and check whether any input point in δ(s) falls in this intersection.This requires O(n log n) time by Lemma 4. Finally, we need to check whether there is a feasible minimum broadcast with the bidirectional structure.Lemma 3 shows that this is also possible in O(n log n) time.
In steps 2 and 3, we compute a shortest s → Q + path backwards.We start from Q + , and put the points into different sets Q + i according to their hop distance to Q + : we put p into Q + i if and only if the shortest path from p to Q + contains i − 1 hops.Notice that in step 3 it is indeed sufficient to consider points from T i , since a point from the level Q + i must be at distance at most 1 from points of Q + i−1 , so it has x-coordinate at least min p∈Q + i−1 x(p) − 1.
If Q + i = ∅, then there is no path from Q + to s-the graph is disconnected-so there is no feasible broadcast set.Otherwise, after the loop in step 3 terminates the shortest s → Q + path has length exactly equal to the loop variable, i.Moreover, the set of possible second vertices on an s → Q + path is δ(s) ∩ Q + i .The same can be said for the next two steps: the shortest s → Q − path has length j, and the set of possible second vertices is δ(s) ∩ Q + i .In the final step, we check if Q + i ∩Q − j is empty or not.If it is empty, then by our previous observation, there are no shortest s → Q + and s → Q − paths that share their second vertex, so the two paths can only share s, resulting in a minimum broadcast set of size i + j + 1; otherwise, any point in Q + i ∩ Q − j is suitable as a shared second point, resulting in a minimum broadcast set of size i + j.
It remains to argue that steps 2-8 require O(n log n) time.We know that a single iteration of the loop in step 3 takes O (|Q , from which the bound on the running time follows.To prove the claim, let p ∈ Q + i−1 be a point with minimal x-coordinate (see Fig. 4).All points p with x(p ) But then any point with x-coordinate at least x(p) − 1 also has x-coordinate at least x(p ) − 1 2 , which means it is in Q + i+2 .Thus both loops require O(n log n) time.Finally, we note that we can easily maintain some extra information in steps 2-7 so the shortest paths we need in step 8 can be reported in linear time.Remark 1.If we apply this algorithm to every disk as source, we get an O(n 2 log n) algorithm for cds in narrow strip UDGs.We can compare this to O(mn), the running time that we get by applying the algorithm for co-comparability graphs [4].Note that in the most difficult case, when the size of the minimum connected dominating set is at most 3, the unit disk graph has constant diameter, which implies that the graph is dense, i.e., the number of edges is m = Ω(n 2 ).Hence, we get an (almost) linear speedup for the worst-case running time.
3 Minimum-size h-hop broadcast in a narrow strip In the hop-bounded version of the problem we are given P and a parameter h, and we want to compute a broadcast set D such that every point p ∈ P can be reached in at most h hops from s.In other words, for any p ∈ P , there must be a path in G from s to p of length at most h, all of whose vertices, except possibly p itself, are in D. We start by investigating the structure of optimal solutions in this setting, which can be very different from the non-hop-bounded setting.
As before, we partition P into levels L i according to the hop distance from s in the graph G, and we define L + i and L − i to be the subsets of points at level i with positive and nonnegative x-coordinates, respectively.Let L t be the highest non-empty level.If t > h then clearly there is no feasible solution.
If t < h then we can safely use our solution for the non-hop-bounded case, because the non-hop-bounded algorithm gives a solution which contains a path with at most t + 1 hops to any point in P .This follows from the structure of the solution; see Lemma 2. (Note that it is possible that the solution given by this algorithm requires t + 1 hops to some point, namely, if ) With the t < h case handled by the non-hop-bounded algorithm, we are only concerned with the case t = h.
We deal with one-sided inputs first, where the source is the leftmost input point.Let G * be the directed graph obtained by deleting edges connecting points inside the same level of G, and orienting all remaining edges from lower to higher levels.A Steiner arborescence of G * for the terminal set L h is a directed tree rooted at s that contains a (directed) path π p from s to p for each p ∈ L h .From now on, whenever we speak of arborescence we refer to a Steiner arborescence in G * for terminal set L h .We define the size of an arborescence to be the number of internal nodes of the arborescence.Note that the leaves in a minimumsize arborescence are exactly the points in L h : these points must be in the arborescence by definition, they must be leaves since they have out-degree zero in G * , and leaves that are not in L h can be removed.Remark 2. In the minimum Steiner Set problem, we are given a graph G and a vertex subset T of terminals, and the goal is to find a minimum-size vertex subset S such that T ∪ S induces a connected subgraph.This problem has a polynomial algorithm in co-comparability graphs [4], and therefore in narrow strip unit disk graphs.However, the broadcast set given by a solution does not fit our hop bound requirements.Hence, we have to work with a different graph (e.g. the edges within each level L i have been removed), and this modified graph is not necessarily a co-comparability graph.
Lemma 6 below states that either we have a path-like solution-for the onesided case a path-like solution is a shortest s → Q + path-or any minimumsize arborescence defines a minimum-size broadcast set.The latter solution is obtained by activating all non-leaf nodes of the arborescence.We denote the broadcast set obtained from an arborescence A by D A .Lemma 6.Any minimum-size Steiner arborescence for the terminal set L h defines a minimum broadcast set, or there is a path-like minimum broadcast set.
Proof.Let A be a minimum Steiner arborescence for the terminal set L h .Suppose that the broadcast set D A defined by the internal vertices of A is not an h-hop broadcast set.(If it is, it must also be minimum and we are done.)By the properties of the arborescence every point in D A can be reached in at most h − 1 hops.Hence, if there is a point p ∈ P that cannot be reached within h hops via D A then p cannot be reached at all via D A .Let i be such that p ∈ L i .Since L h ⊂ A, we know that i < h.Take any path from s to any point in L h−1 inside the arborescence.By Observation 1(iii), this path covers all lower levels.Hence, i h − 2, which implies p ∈ L h−1 .
Without loss of generality, suppose that p has the highest x-coordinate among points not covered by A. Let q be the point in P with the largest x-coordinate.If q ∈ L h−1 , then a shortest s → q path is a feasible broadcast set of size at most |A| that is path-like.Therefore, we only need to deal with the case q ∈ L h .Let p ∈ A be an internal vertex of the arborescence whose disk covers q.The arborescence contains an s → p path, which, by Observation 1(i), covers everything with x-coordinate up to . Since q has the maximum x coordinate, Observation 1(i) shows that the disks of a shortest s → p path form a feasible broadcast set, which is a path-like solution.
Notice that a path-like solution also corresponds to an arborescence.However, it can happen that there are minimum-size arborescences that do not define a feasible broadcast; see Fig. 5. Lemma 6 implies that if this happens, then there must be an optimal path-like solution.The lemma also implies that for non-pathlike solutions we can use the Dreyfus-Wagner dynamic-programming algorithm to compute a minimum Steiner tree [10], and obtain an optimal solution from this tree. 3Unfortunately the running time is exponential in the number of terminals, which is |L h | in our case.However, our setup has some special properties that we can use to get a polynomial algorithm.
We define an arborescence A to be nice if the following holds.For any two arcs uu and vv of A that go between the same two levels, with u = v, we have: y(u ) < y(v ) ⇒ y(u) < y(v).Intuitively, a nice arborescence is one consisting of paths that can be ordered vertically in a consistent manner, see the left of Fig. 6.We define an arborescence A to be compatible with a broadcast set D if D = D A .Note that there can be multiple arborescences-that is, arborescences with the same node set but different edge sets-compatible with a given broadcast set D.
Observation 3. In a minimum broadcast set on the strip, the difference in xcoordinates between active points from a given level L Proof.Let p and q be active points from L i , and suppose for contradiction that x(p) > x(q)+ 1 2 .By Observation 1(i), all points to the left of p are covered by the active points, so we only need to show that there are no points in L i+1 whose hop distance becomes longer by removing δ(q) from the solution.Indeed, consider a point v ∈ L i+1 ∩ (δ(q) \ δ(p)).Since δ(q) \ δ(p) lies to the left of p, x(v) < x(p).So v has a path of at most i + 1 hops.Hence we still have a feasible solution after removing δ(q), which contradicts the optimality of the original solution.
Lemma 7. Let p ∈ L i be a point in an optimal broadcast set D. Then there is a path of length i from s to p in G[D], the graph induced by D.
Proof.We say that a vertex p Note that π q covers all lower levels L h−2 using at most h hops.Since i is the highest level with a bad point, all points v ∈ D ∩ L i+1 have a shortest path in G[D], and such a path cannot pass through p.
Since p is a necessary point in this broadcast, and it is already covered by the disks of π q in at most h hops, there must be a point p to which all covering paths of length at most h pass through p.Since all points of L h are covered by D ∩ L h−1 and L h−2 is covered by π q , the level of p has to be h − 1.A covering path to p has only bad vertices after p, so its point in L h−2 is bad.By the choice of p, we have p ∈ L h−2 , and since p is reached in exactly h hops, it also follows that p ∈ δ(p).
Note that p cannot be to the left of δ(q), since then π q would cover it in at most h hops; therefore, x(p ) > x(q) + 1 2 .It follows that x(p) x(q) − 1 2 , so δ(p) covers q.Since q is an arbitrary point in Let D be the broadcast obtained by replacing D ∩ L h−2 with a shortest s → p path π p .We claim that D = π p ∪ (D ∩ L h−1 ) is a feasible broadcast: it covers L h since points of L h could only be covered by D ∩ L h−1 , and it is easy to check that all points are covered in at most h hops.We arrived at a contradiction since D is smaller than Lemma 8. Every optimal broadcast set D has a nice compatible arborescence.
Proof sketch.To find a nice compatible arborescence we will associate a unique arborescence with D. To this end, we define for each p ∈ (D ∪ L h ) \ {s} a unique predecessor pred (p), as follows.Let ∂ * i be the boundary of {δ(p)|p ∈ L i ∩ D}.It follows from Observation 3 that the two lines bounding the strip S cut ∂ * i into four parts: a top and a bottom part that lie outside the strip, and a left and a right part that lie inside the strip.Let ∂ i be the part on the right inside the strip.We then define the function pred : (D ∪ L h ) \ {s} → D the following way.Consider a point p ∈ (D ∪ L h ) \ {s} and let i be its level.Let ray(q) be the horizontal ray emanating from q to the right; see the right of Fig. 6.It follows from Observation 1(iii) that ray(q) cannot enter any disk from level i−1.We can prove that any point p ∈ D ∩ L h is contained in a disk from p's previous level, so pred (p) is well defined for these points.The edges pred (p)p for p ∈ D ∩ L h thus define an arborescence.We can prove that it is nice by showing that the y-order of the points in a level L i corresponds to the vertical order in which the boundaries of their disks appear on {δ(p) : p ∈ L i ∩ D}.
Proof.Recall that pred (p), for p ∈ L i ∩ D, is the center of the level i − 1 disk which has z = ray(p) ∩ ∂ i−1 on its boundary.If there are multiple such disks, we can break ties by choosing pred (p) to be the point with the highest y-coordinate in L i ∩ D whose disk passes through z.
Let A be the directed graph defined by the edges pred (p)p for each p ∈ (D ∪ L h ) \ {s}.We show that A is a nice arborescence.By definition of the pred -function, each edge is between points at distance at most 1 that are in subsequent levels.Hence, the edges we add define an arborescence A on G * with terminal set L h .It remains to prove that A is nice.
Consider the edges of A going between points in L i−1 and points in L i .By drawing horizontal lines through each of the breakpoints of ∂ i−1 , the strip S is partitioned into horizontal sub-strips, such that two points from L i are assigned the same predecessor iff they lie in the same sub-strip.Number the sub-strips S 1 , S 2 , . . . in vertical order, with S 1 being the bottommost sub-strip.Let u j ∈ D∩L i−1 be the point that is the predecessor of the points in the sub-strip S j .To show that A is nice, it is sufficient to demonstrate that the sequence u 1 , u 2 , . . . is ordered by the y-coordinates of the points.
Suppose for a contradiction that this is not the case.Then there are points u j and u j+1 such that y(u j ) > y(u j+1 ).Let z be the breakpoint on ∂ i−1 between the arcs defined by δ(u j ) and δ(u j+1 ).Since z is in the right half circle of both δ(u j ) and δ(u j+1 ), we have max{x(u j ), x(u j+1 )} < x(z).Since |u j z| = |u j+1 z| = 1, the point z lies on the perpendicular bisector of u j u j+1 to the right of u j and u j+1 .Since y(u j ) > y(u j+1 ), the outer circle below the bisector is δ(u j+1 ) and the outer circle above the bisector is δ(u j ).This contradicts the ordering of the sub-strips.
Let q 1 , q 2 , . . ., q m be the points of L h in increasing y-order.The crucial property of a nice arborescence is that the descendant leaves of a point p in the arborescence form an interval of q 1 , q 2 , . . ., q m .Using the above lemmas, we can adapt the Dreyfus-Wagner algorithm and get the following theorem.The algorithm to find a nice Steiner arborescence is based on dynamic programming.A subproblem is defined by a point p ∈ P and an interval of the last level (that is, an interval of the sequence q 1 , q 2 , . . ., q m , the points of L h ordered by y-coordinates).The solution of the subproblem M (p, [i, j]), for 1 i j m, is the minimum number of internal vertices in a nice arborescence which is rooted at p and contains q i , q i+1 , . . ., q j as leaves.Recall that d G * (p, q) denotes the hop distance function in G * , where d G * (p, q) = ∞ if there is no path from p to q.We claim that the following recursion holds: The number of subproblems is O(n 3 ), each of them requires computing the minimum of at most O(n) values.This results in an algorithm that runs in O(n 4 ) time.The minimum broadcast set size is M (s, [1, m]); if we keep track of a representing arborescence for each subproblem, we can also return a minimum broadcast set without any extra runtime cost.
To prove correctness, we need to show that Equation ( 1) is correct.The base case, i = j, is obviously correct, so now assume i < j.It is easily checked that M (p, [i, i]) is at most the right-hand side of the equation.For the reverse direction, consider a nice optimal Steiner arborescence A for M (p, [i, j]).If p has exactly one outgoing arc in A, that arc must end in a point p ∈ P ∩ δ(p) \ {p}.Then A \ {p} is an arborescence rooted at p that spans [i, j], so it has at least M (p , [i, j]) internal vertices.If p has at least two outgoing internal vertices, then let p be the child of p with the lowest y-coordinate.Since the arborescence is nice, the descendant leaves of p in A form a sub-interval of [i, j] that starts at i. Let q t be the leaf with the highest y-coordinate among the descendants of p .If A had strictly less internal vertices than M (p, [i, t]) + M (p, [t + 1, j]), then it would need to include a nice sub-arborescence with less internal vertices for at least one of the subproblems M (p, [i, t]) or M (p, [t + 1, j]), but that would contradict the optimality in the definition of the subproblems.
In the general (two-sided) case, we can have path-like solutions and arborescencebased solutions on both sides, and the two side solutions may or may not share points in L 1 .We also need to handle "small" solutions-now these are 2-hop solutions-separately.
Theorem 5.The h-hop broadcast problem inside a strip of width at most √ 3/2 can be solved in O(n 6 ) time.
Proof.We first analyze the possible structures of an optimal solution.
Claim.For any input P inside small strip that has a feasible h-hop broadcast set, there is a minimum h-hop broadcast set D that has one of the following structures: -2-hop: A solution D that does not not contain any active points from L 2 .(Note that such a solution might be optimal even if h > 2.) -Path-like: A solution D that consists of two shortest paths, one from s to Q + and one from s to Q − , possibly sharing their first vertex after s. -Mixed : A shortest path on one side, and a nice arborescence on the other side, where the shortest path may share its L 1 -vertex with the arborescence.-Arborescence-based : A single arborescence for L h , which is nice on both sides.Proof of claim.Suppose that there is no optimal 2-hop solution for P .Thus any optimal solution has active points on L 2 .Let π + and π − be shortest paths to Q + and Q − , respectively.If both π + and π − have at most h − 1 edges then everything can be reached in h hops.Hence, this is an optimal path-like solution (since it is minimal even for the non-hop-bounded version).
If π + has h + 1 hops and π − has at most h hops, then there is no path-like h-hop broadcast for the right side of the input, that is, for the set P * := {P ∩ (δ(s) ∪ S 0 )}.Let T be a minimum-size nice arborescence for P * .By Lemma 6 and Lemma 8, T gives a minimum h-broadcast set for P * .Either there is a shortest s → Q − path whose L 1 -vertex is also in a minimum-size arborescence, or there isn't.In both cases, the resulting mixed solution must be optimal.Thus, if exactly one of π + and π − has h + 1 hops and the other has fewer hops, then there is a mixed optimal solution.Now suppose both paths have h + 1 hops.We now now consider an optimal solution D and extend the definition of the pred function (as described below) to conclude that D defines a nice arborescence.Let pred + be the previously defined function in L 1 ∪ L + i , and let pred − be the same function for the left side L 1 ∪L − i .Note that points in L 1 belong to both sides, but for a point p ∈ L 1 we have pred − (p) = pred + (p) = s, so this is not an issue.The arborescence defined by this function is nice on both sides by Lemma 8.In addition, since there is no pathlike h-hop broadcast set on either side, the active points corresponding to this arborescence form a minimum h-hop broadcast set: by applying Lemma 6 on both sides, we see that the broadcast set corresponding to this arborescence covers all points.
The best 2-hop solution can be found using our planar 2-hop broadcast algorithm from Theorem 11.The best path-like solution can be found by invoking the narrow-strip broadcast algorithm from Theorem 2, and checking if it satisfies the hop-bound.It remains to describe how to find the best mixed and arborescencebased solutions.
Claim.The best mixed solution can be found in O(n 5 ) time.
Proof of claim.Suppose that Q − can be reached in t h hops.Recall from the one-sided case that Q − i is the set of points p such that the shortest path from p to (This set can be computed using our algorithm from Theorem 2.) We need to be able to find the potential second points of a nice arborescence.First, we run the one-sided dynamic programming algorithm on the set P * := {P ∩ (δ(s) ∪ S 0 )}, which takes O(n 4 ) time.Let M (•, [•, •]) be the resulting dynamic-programming table.We claim that p ∈ L 1 is a potential second point if and only if there is an interval [i, j] such that where m + = |L + h |.To prove the claim, first assume that Equality (2) holds.Then the arborescences corresponding to each M -value on the right side are nice minimum arborescences rooted at s, p and s respectively-the fact that s is counted twice explains the -1 term-and so their union together with the edge sp is a minimum arborescence that uses p as as second point.On the other hand, if there is a minimum arborescence using p, then there is a nice one and the set of ancestors of p is an subsequence q i , . . ., q j of L + h .The points q 1 , . . ., q i−1 and q j+1 , . . ., q m + are covered by two nice arborescences rooted at s, and the niceness implies that these subtrees only share s.Thus, Equality (2) holds.
Hence, after filling in all entries in the table , we can find all potential second points in O(n 3 ) time by checking all values i, j for each point p ∈ L 1 .If there is such a point p in B − , then the best mixed solution has size With standard techniques, an h-hop broadcast set realizing this optimum can be computed within the same time bound.
Claim.The best arborescence-based solution can be found in O(n 6 ) time.
Proof of claim.In order to find the best arborescence-based solution, we modify the one-sided algorithm the following way.For all p ∈ L 1 ∪ h i=2 L + i we define the subproblems A + (p, [i, j]) as previously, where [i, j] refers to an interval in the last right side level L + h .Similarly, we define an ordering on the last left level based on y-coordinates, and define for all ).We can compute these values using the one-sided algorithm on both sides.
It will be convenient to generalize the definitions above as follows.First of all, we extend the definition of A + (p, [i, j]) to include all points p ∈ P -not only the points in ) is extended similarly.Finally, we define A + (p, [i, j]) := 0 and A − (p, [i, j]) := 0 for j = i − 1.
We also need a third kind of subproblem.Define A(p, [i, j], [k, ]) as the number of internal vertices in an optimum arborescence rooted at p that has leaves q − i , . . ., q − j in the last left level and from q − k , . . ., q − on the last right level.If p = s, this can be easily expressed: ( Note that on the right side of this formula, at least one of the summands is ∞ if p ∈ L 2 , and possibly for some points in L 1 as well.Since the formula is so simple, we do not need to compute these values explicitly.
The only computation for this kind of subproblem is required at the source, for which we require a new notation.Let The set sep(i, j, k, l) is a shorthand for the set of pairs (t, u) that separate the interval pair Our formula for the source is the following: otherwise.
The initialization of the values is straightforward: k ) Once the one-sided subproblem values are computed, the above dynamic program can be initialized and computed in increasing order of (j − i) + ( − k).The number of subproblems that we need to compute is O(n 4 ), each of which require taking the minimum of O(n 2 ) values.This enables a running time of O(n 6 ).To prove the correctness of the algorithm, we only need to show that our formulas for L 1 and the source are correct.Again, the inequality A s, . . . is trivial, so we only need to show that there is an optimal solution which has the desired structure.
We start with an optimal arborescence that is nice when restricted to both For a point p ∈ L 1 , if the subproblem has a non-empty interval on both sides, then there is a branching at p.The arborescence can be partitioned into a left and right sub-arborescence, so equation (3) holds.
At the source, we only need to explain the case when there is a branching at s, the other case is trivial.Let p ∈ L 1 be the child of s that has the smallest y-coordinate.Since the left and right sub-arborescences are nice, the descendant leaves of p on the left form a starting slice [i, t] of the last level on the left, and the descendant leaves on the right form a starting slice [k, u] of the last level on the right.The rest of the intervals are descendants of the other branches.This demonstrates that the cost of the optimal arborescence can be written as The overall algorithm computes the best feasible broadcast set of each type, if it exists: 2-hop, path-like, mixed (for both sides), and arborescence-based Since the minimum broadcast set must have one of these types, the minimum among these is a minimum h-hop broadcast set.The overall running time is O(n 6 ).

A parameterized look at CDS-UDG
In this section we prove that cds-udg is W[1]-hard parameterized by the solution size; our proof heavily relies on the proof of the W[1]-hardness of ds-udg by Marx [17].
The construction by Marx for DS-UDG.Marx uses a reduction from Grid Tiling [8] (although he does not explicitly state it this way).In a grid-tiling problem we are given an integer k, an integer n, and a collection S of k One can picture these sets in a k × k matrix: in each cell (a, b), we need to select a representative from the set U a,b so that the representatives selected from horizontally neighboring cells agree in the first coordinate, and representatives from vertically neighboring sets agree in the second coordinate.
Marx's reduction places k 2 gadgets, one for each U a,b .A gadget contains 16 blocks of disks, labeled X 1 , Y 1 , X 2 , Y 2 , . . ., X 8 , Y 8 , that are arranged along the edges of a square-see Fig. 8(i).Initially, each block X contains n 2 disks, denoted by X (1), . . ., X (n 2 ) and each block Y contains n 2 + 1 disks denoted by Y (0), . . ., Y (n 2 ).The argument j of X (j) can be thought of as a pair (x, y) with 1 x, y n for which f (x, y) := (x − 1)n + y = j.Let f −1 (j) = (ι 1 (j), ι 2 (j)) = (1 + j/n , 1 + (j mod n)).For the final construction, in each gadget at position (a, b), delete all disks X (j) for each = 1, . . ., 8 and (ι 1 (j), ι 2 (j)) ∈ U a,b .This deletion ensures that the gadgets represent the corresponding set U a,b .The construction is such that a minimum dominating set uses only disks in the Xblocks, and that for each gadget (a, b) the same disk X (j) is chosen for each 1 8.This choice signifies a specific choice u a,b = (x, y).To ensure that the choice for u a,b in the same row and column agrees on their first and second coordinate, respectively, there are special connector blocks between neighboring gadgets.The connector blocks are denoted by A, B, C and D in Fig. 8(i), and they each contain n + 1 disks-see Section 4 for further details.
Our construction for CDS-UDG.To extend the construction to cds-udg, we have to make sure there is a minimum-size dominating set that is connected.This requires two things.First, we must add new disks inside the gadgetsthat is, in the empty space surrounded by the X-and Y -blocks-to guarantee a connection between all chosen X (j) disks without interfering with the disks in the Y -blocks.Second, we need to connect all the different gadgets.This time, in addition to avoiding the Y -blocks, we also need to avoid interfering with the connector blocks.The idea is as follows.Inside each gadget we add several pairs of disks, consisting of a parent disk and a leaf disk.The parent disks are placed such that, for any choice of one disk from each of the X-blocks, the parent disks together with the eight chosen disks from the X-blocks form a connected set.Moreover, the parent disks do not intersect any disk in a Y -block.See Fig. 8(ii) for an illustration; the parent disks are blue in the figure .For each parent disk we add a leaf disk -the red disks in the figure-that only intersects its parent disk.This ensures there is a minimum dominating set containing all the parent disks, which in turn implies that any minimum dominating set for the gadget is connected.
In Fig. 8(ii) we used disks of different sizes.Unfortunately this is not allowed, which makes the construction significantly more tricky.To be able to place the pairs in a suitable way, we need to create more space inside the gadget.To this end we use a gadget consisting of 16 (instead of eight) X-and Y -blocks.This will also give us sufficient space to put parent-leaf pairs in between the gadgets, so the dominating sets from adjacent gadgets are connected through the parent disks; see Section 4 for details.Thus the size of a minimum connected dominating set in the new construction is equal to the size of a minimum dominating set in the old construction plus the number of parent disks.Hence, we can decide if the Grid Tiling instance has a solution by checking the size of the minimum connected dominating set in our construction.Thus cds-udg is W[1]-hard.Moreover, if the Exponential Time Hypothesis (ETH) holds, then there is no algorithm for Grid Tiling that runs in time f (k)n o(k) [8].We thus obtain the following result.Theorem 6.The broadcast problem and cds-udg are W[1]-hard when parameterized by the solution size.Moreover, there is no f (k)n o( √ k) algorithm for these problems, where n is the number of input disks and k is the size of the solution, unless ETH fails.
Remark.Using a modified version of an algorithm by Marx and Pilipczuk [18], it is possible to construct an algorithm for cds-udg with running time n O( √ k) .Some details of the construction in [17].In every block, the place of each disk center is defined with regard to the midpoint of the block, (x(z), y(z)).The center of each circle is of the form (x(z) + α , y(z) + β ) where x(z), y(z), α and β are integers, and > 0 a small constant.We say that the offset of the disk centered at (x(z) + α , y(z) + β ) is (α, β).Note that |α|, |β| n, and < n −2 , so the disks in a block all intersect each other.The offsets of X and Y -blocks are defined as follows.
Lemma 9 (Lemma 1 of [17]).Assume that a gadget is part of an instance such that none of the blocks Y i are intersected by disks outside the gadget.If there is a dominating set ∆ of the instance that contains exactly 8k 2 disks, then there is a canonical dominating set ∆ with |∆ | = |∆|, such that for each gadget G, there is an integer 1 j G n such that ∆ contains exactly the disks X 1 (j G ), . . ., X 8 (j G ) from G.
In the gadget G a,b , the value j defined in the above lemma represents the choice of s a,b = (ι 1 (j), ι 2 (j)) in the grid tiling problem.Our deletion of certain disks in X-blocks ensures that (ι 1 (j), ι 2 (j)) ∈ U a,b .Finally, in order to get a feasible grid tiling, gadgets in the same row must agree on the first coordinate, and gadgets in the same column must agree on the second coordinate.These blocks have n + 1 disks each, with indices 0, 1, . . ., n.We define the offsets in the connector gadgets the following way.
Using this definition, it is easy to prove the following lemma.
Lemma 10.Let ∆ be a canonical dominating set.For horizontally neighboring gadgets G and H representing j G and j H , the disks of the connector block A are dominated if and only if ι 1 (j G ) ι 1 (j H ); the disks of B are dominated if and only if ι 1 (j G ) ι 1 (j H ). Similarly, for vertically neighboring blocks G and H , the disks of block C are dominated if and only if ι 2 (j G ) ι 2 (j H ); the disks of D are dominated if and only if ι 2 (j G ) ι 2 (j H ).
With the above lemmas, the correctness of the reduction follows.A feasible grid tiling defines a dominating set of size 8k 2 : in gadget G a,b , the dominating disks are X (f (s a,b )) , = 1, . . ., 8. On the other hand, if there is a dominating set of size 8k 2 , then there is a canonical dominating set of the same size that defines a feasible grid tiling.
Details of the CDS-UDG construction.To extend the construction to cdsudg, we want to make sure that minimum-size dominating set is connected.This requires two things.First, we must add new disks "inside" the gadgetsthat is, in the empty space surrounded by the X and Y -blocks -such that a canonical minimum dominating set includes some new disks that connect the chosen X (j) disks without interfering with disks in the Y -blocks.Second, we need to connect all the different gadgets.This time in addition to avoiding the Y -blocks, we also need to avoid interfering with the connector blocks.
In order to have enough space, our gadgets contain 16 X-blocks and 16 Yblocks instead of eight.The offsets of disks inside the blocks are not modified: we use the same building blocks.Fig. 10 shows how we arrange these blocks, and depicts the connector block placement.
The analogue of Lemma 9 and Lemma 10 are true here; we have a construction that could be used to prove the W[1]-hardness of ds-udg, with canonical sets of size 16k 2 , that contain one disk from each X-block and X -block.We extend this construction with parent-leaf pairs so that we have canonical dominating sets that span a connected subgraph.
The most important property of the blocks that we use is that for a small enough value , the boundaries of the disks in a block all lie inside a small width annulus -for this reason, the blocks in our pictures are depicted with thick boundary disks.In order for a parent disk p to intersect every disk in a block it is sufficient if the boundary of p crosses this annulus.
We are going to add 72 extra disks to every gadget, and 4 "connector" disks between every pair of horizontally or vertically neighboring gadgets, resulting in canonical dominating sets of size 16k 2 + 36k 2 + 4k(k − 1) = 56k 2 − 4k (Note that only the parent disks are included in the canonical set).In other words, the new construction has a connected dominating set of size 56k 2 − 4k if and only if there is a feasible grid tiling.
Inside any of the blocks, all offsets are in the rectangle with bottom left (−n 2 − 1, −n 2 − 1) and top right (n 2 + 1, n 2 + 1).Consequently, every circle in the block with center (r, s) passes through the square with bottom left (−n 2 − 1) , 1 − (n 2 + 1) and top right (n 2 + 1) , 1 + (n 2 + 1) .There are three similar squares that also have this property, which we can get by rotating the square around the midpoint of the block by 90, 180 and 270 degrees.Consequently, a unit disk that contains such a square intersects all the disks in the given block.For an example with n = 3 and = 0.02 for the block X 2 , see Fig. 9.
Connecting neighboring gadgets.For a pair of horizontally neighboring gadgets, we add two pairs of disks that connect X 3 from the left gadget to X 8 in the right gadget.This arrangement is depicted on the left of Fig. 12.The parent disk with center T 1 intersects every disk in the block X 3 of the left gadget, and the other parent intersects every disk in the block X 8 .The two leaf disks (red disks in the figure) only intersect their parent.Let the origin be the center of the block X 3 in the left gadget.The coordinates for the disk centers are: We use a rotated version of these four disks for vertical connections, where the parents connect X 5 from the upper gadget and X 2 from the lower gadget.Disks inside gadgets.We begin by adding eight disk pairs to the center.The parents are arranged in a square, touching the neighbors, and the leafs are placed so that it is possible to connect from the outside on each side.See Fig. 11 for a picture: the corresponding leaf disks have parallel lines as a pattern.
Let δ > 0 be a small constant to be specified later.From now on, we fix the origin in the center of the bottom left block, Y 7 .The coordinates of the disks centers are given below; in each pair we specify the coordinates of a parent and its leaf.(6,10), (6, 10 + δ) (6,8), (6 + 4δ, 8) In order to connect the X-blocks, we need to connect the blocks of each side to the central disks.For this purpose, we are going to use a zigzag pattern of disks.The first parent disk intersects all disks in X 6 and X 7 (i.e., it crosses the small squares of X 6 and X 7 that are facing the inside of the gadget).The second Fig. 13.The zig-zag arrangement parent is above the block Y 6 , but it is disjoint from it.The next with center p 3 intersects all disks in X 6 , and the disk around p 4 is disjoint from the disks in Y 6 .Finally, the disk around p 5 intersects all disks in X 5 .See Fig. 13 for an example.The leafs follow a more complicated pattern.In our zigzag pattern, two neighboring parents touch each other.We need them to have distance 2δ along the y axis, so the distance along the x axis is We add two more disk pairs to this pattern, and some modifications to the leafs.These seven disk pairs are depicted on the right side of Fig. 12.We list the coordinates of the disk centers below.
Our final gadget can be attained by rotating the above seven disk pairs around the center (8,8) by 90, 180 and 270 degrees: see Fig. 14.We added the spanned edges of a canonical dominating set to this picture.
We can now turn to the proof of the following theorem.
Proof.A feasible grid tiling defines 16k 2 disks: in gadget (a, b), we include the disks X (f (s a,b )) and X (f (s a,b )) for all = 1, . . ., 8. We add all parent disks of the construction, this results in a connected dominating set of size 56k 2 − 4k.In the other direction, if there is a connected dominating set of size 56k 2 − 4k, then there is a canonical dominating set of the same size, whose disks inside X-blocks and X -blocks define a feasible grid tiling.Thus, it is sufficient to prove that the intersection patterns are as described.
It can be verified using the coordinates that our final leaf disks only intersect their parent disk, and also that the parent disks form a connected subgraph both inside gadgets and at every connection.We need to show that the parents inside a gadget connect all the X-blocks of a gadget, and that the horizontal and vertical connectors intersect the two X-blocks that they need to connect.In all of these cases, it is sufficient to show that the parent disk contains one of the four squares that we associated with each block.For connector disks, it is easy to see that the center of one of the four squares is covered by the interior of the corresponding parent disk (i.e., the square around (1, 0) is contained in the interior of δ(T 1 )).By choosing a small enough value for , the square is contained in the parent disk.
For the inner connections of gadgets, it is sufficient to show that the inner squares of X 7 , X 6 , X 6 and X 5 are contained in δ(p 1 ), δ(p 1 ), δ(p 3 ) and δ(p 5 ) respectively: the other sides have the same containments since the rotation around (8,8) by 90, 180 and 270 degrees are automorphisms on the small squares.The largest distance between parent disk and the corresponding small square is at δ(p 5 ) and the inner small square of block X 5 .The farthest corner of the square from p 5 is 10 + (n 2 + 1) , 1 − (n 2 + 1) .Let < 1 2n 3 and δ < 1.The distance squared from p 5 has to be at most 1: Note that the coordinates of each point can be represented with O(log n) bits, since a precision of c/n 4 is sufficient for the construction.
We can let one of the blue parent disks be the source disk: in this way, the minimum broadcast sets equal the minimum connected dominating sets.We get the following corollary.
Corollary 1.The broadcast problem is W[1]-hard parameterized by the size of the broadcast set.

Broadcasting in a wide strip
We show that the broadcast problem remains polynomial in a strip of any constant width, or more precisely, it is in XP for the parameter w (the width of the strip).
Theorem 8.The broadcast problem and cds-udg can be solved in n O(w) time on a strip of width w.Moreover, there is no algorithm for cds-udg or the broadcast problem with runtime f (w)n o(w) unless ETH fails.
We begin by showing the following key lemma.Lemma 11.Let D be the disk centers of a minimum connected dominating set of a unit disk graph on a strip of width w, and let R be an axis parallel rectangle of size 2 × w.Then the number of points in D ∩ R is at most 32w √ 3 + 14.
When computing A(k, U, ∼) (for which there is a representative of each equivalence class of ∼ in [k, k + 1] × [0, w]), we first need to find the subproblems We can find these potential subproblems by going through all subproblems A(k − 1, ., .), and for each of these, we can decide in polynomial time whether it is compatible with A(k, U, ∼).Overall, computing the solution of a single subproblem takes n O(w) time, so finding the optimal broadcast set in the one sided case can be done in n O(w) time.
For the two sided case, we need to include in the subproblem description the set of active points on both ends.Let k ∈ N, let and let ∼ be a relation on The number of subproblems is still n O(w) , so the running time is also n O(w) .
Surprisingly, the h-hop version has no n O(w) algorithm (unless P =NP).

The hardness of h-hop broadcast in wide strips
The goal of this section is to prove the following theorem.
Theorem 9.The h-hop broadcast problem is NP-complete in strips of width 40.
(The theorem of course refers to the decision version of the problem: given a point set P , a hop bound h, and a value K, does P admit an h-hop broadcast set of size at most K?) Our reduction is from 3-SAT.Let x 1 , x 2 , . . .x n be the variables and C 1 , . . ., C m be the clauses of a 3-CNF.

Proof overview
Fig. 7 shows the structural idea for representing the variables, which we call the base bundle.It consists of (2h − 1)n + 1 points arranged as shown in the figure, where h is an appropriate value.The distances between the points are chosen such that the graph G, which connects two points if they are within distance 1, consists of the edges in the figure plus all edges between points in the same level.Thus (except for the intra-level edges, which we can ignore) G consists of n pairs of paths, one path pair for each variable x i .The i-th pair of paths represents the variable x i , and we call it the x i -string.By setting the target size, K, of the problem appropriately, we can ensure the following for each x i : any feasible solution must use either the top path of the x i -string or the bottom path, but it cannot use points from both paths.Thus we can use the top path of the x i -path to represent a true setting of the variable x i , and the bottom path to represent a false setting.A group of consecutive strings is called a bundle.We denote the bundle containing all x t -strings with t = i, i + 1, . . ., j by bundle(i, j).The clause gadgets all start and end in the base bundle, as shown in Fig. 15.The gadget to check a clause involving variables x i , x j , x k , with i < j < k, roughly works as follows; see also the lower part of Fig. 15, where the strings for x i , x j , and x k are drawn in red, blue, and green respectively.
First we split off bundle(1, i − 1) from the base bundle, by letting the top i − 1 strings of the base bundle turn left.(In Fig. 15 this bundle consists of two strings.)We then separate the x i -string from the base bundle, and route the x i -string into a branching gadget.The branching gadget creates a branch consisting of two tapes-this branch will eventually be routed to the clausechecking gadget-and a branch that returns to the base bundle.Before the tapes can be routed to the clause-checking gadget, they have to cross each of the strings in bundle(1, i − 1).For each string that must be crossed we introduce a crossing gadget.A crossing gadget lets the tapes continue to the right, while the string being crossed can return to the base bundle.The final crossing gadget turns the tapes into a side string that can now be routed to the clause-checking gadget.The construction guarantees that the side string for x i still carries the truth value that was selected for the x i -string in the base bundle.Moreover, if the true path (resp.false path) of the x i -string was selected to be part of the broadcast set initially, then the true path (resp.false path) of the rest of the x i -string that return to the base bundle must be in the minimum broadcast set as well.
After we have created a side string for x i , we create side strings for x j and x k in a similar way.The three side strings are then fed into the clause-checking gadget.The clause-checking gadget is a simple construction of four points.Intuitively, if at least one side string carries the correct truth value-true if the clause contains the positive variable, false if it contains the negated variable-, then we activate a single disk in the clause check gadget that corresponds to a true literal.Otherwise we need to change truth value in at least one of the side strings, which requires an extra disk.
The final construction contains Θ(n 4 m) points that all fit into a strip of width 40.
In order to simplify our discussion and figures, we scale the input such that a can broadcast to b if their unit disks intersect (or equivalently, if their distance is at most 2).

Handling strings and bundles
We start the initial bundle directly from the source, and end each string with a disk that intersects the last true and false disk of the given variable, as already seen in Fig. 7. (A true disk is a disk on a true path, a false disk is a disk on a false path.)A minimum-size solution of this bundle for h = 7 contains the source disk and true or false disks for each of the 3 strings.In the final construction, once all the clause checks are done and the strings have returned to the bottom bundle, we are going to add some extra levels so that the h-hop restriction does not interfere with the last side strings.(This can be done by for example doubling the maximum distance from s.) The disks of a given level in a bundle lie on the same vertical line, at distance 1 2n from each other, so for a bundle containing all the variables, the disk centers on a given level fit on a vertical segment of length 1, and the whole bundle fits in width 3. Bundled strings are in lockstep, i.e., a pair of intersecting disks in the bundle that are not in the same string and truth value are on the same level.We call this the lockstep condition.
Next, we describe some important aspects of handling strings, bundles and side strings.First, we show that we can do turns with strings in constant horizontal space, and do turns in bundles in polynomial horizontal space.An example of a string turn can be seen in Fig. 17  This turning operation can be used on the top string of a bundle to "peel" off strings one by one and unify them later in a new bundle, see Fig. 18.This is how we can split and turn a bundle: we peel and turn the strings one by one.Notice that the lockstep condition is upheld both in the bottom and top bundle.It requires O(n) extra horizontal space and O(n 2 ) disks to split a bundle with this method.
If we were to return the strings one by one to the bottom bundle without correction as depicted in Fig. 15, the returning strings would be in a level disadvantage compared to the bottom bundle, so the new bundle would violate the lockstep condition.To avoid this issue, we use a correction mechanism.We have some room to squeeze bundle levels horizontally.The largest horizontal distance between neighboring levels is 2; for the smallest distance, we need to make sure that a disk does not intersect other disks from neighboring levels other than the disks in the same string with the same truth value.So the horizontal distance has to be at least 2 1 − 1 4n 2 < 2 − 1 15n 2 .Thus, if we have 15n 2 compressed levels in a bundle, then they take up the same horizontal space as 15n 2 − 1 maximum distance levels.
A detour of a string (peeling off, going through a gadget, returning to the bottom bundle) requires a constant number of extra levels to achieve, we can compensate for this with the addition of a polynomial number of extra disks.Before a string peels off from the top bundle downward to rejoin the bottom bundle, we add 15n 2 k compressed levels to the top bundle and (15n 2 − 1)k maximum distance levels to the bottom bundle, if the total number of extra levels added by turning up, going through the gadget and turning down is k.This ensures that the lockstep condition is upheld in the bottom bundle after the return of this string.For each string that leaves the bottom bundle and later returns, we use this correction mechanism.Overall, this correction mechanism is invoked a polynomial number of times, so requires a polynomial number of disks.

Tapes
Our tapes consist of tape blocks: a tape block is a collection of three disks, the centers of which lie on a line at distance apart -so it is isometric to the old connector blocks A, B, C and D for the case "n"= 2 (see Section 4).Denote the three disks inside a tape block T k by δ k 1 , δ k 2 and δ k 3 .We can place multiple such blocks next to each other to form a tape.An example is depicted in Fig. 19.
The tapes always connect blocks in which disks have truth values assigned, e.g., the end of a string or disks of a gadget block.Denote the starting true and false disks by F and the ending true and false disks by G.We say that a set of tape blocks T 1 , T 2 , . . ., T p forms a tape from F to G if it satisfies the following conditions.
-In the first block, δ 1  1 intersects both the true and false disk(s) of F , δ 1 2 intersects the true disk(s) of F , and δ 1 3 is disjoint from both the true and false disk(s).
δ k i intersects the disk δ k+1 j if and only if j i (k = 1, . . ., p − 1).-In the last block, δ p 1 is disjoint from G, δ p 2 intersects the false disk(s) of G, and δ p 3 intersects both the true and false disk(s).-Non-neighboring tape blocks are disjoint, F is disjoint from all blocks except the first, and G is disjoint from all blocks except the last.
We would like to examine the set of disks that are used in a minimum broadcast set from a tape.Lemma 12. Let T be a tape from F to G that has p tape blocks.Every h-hop broadcast set contains at least p−1 disks from the tape.If a broadcast set contains exactly p − 1 disks, then the truth value of F is is at least the truth value of G, i.e., it cannot happen that the active disks in F are all false disks and the active disks in G are all true disks.Proof.Let the tape blocks be T 1 , T 2 , . . ., T p .If there are at most p − 2 active disks, then there are at least two empty blocks.These blocks have to be neighboring, otherwise a point in between the two blocks is impossible to reach from the source.Let these blocks be T k and T k+1 .All disks in T k must be reached through the blocks F, T 1 , . . ., T k−1 .Specifically, δ k 3 has to be reached.The shortest path to this point from any F -disk requires at least k tape disks.Similarly, the shortest path from any G-disk to δ k+1 1 requires at least t − k disks.Overall, at least t active disks of the tape are required to reach these disks -this is a contradiction.
If the tape contains t − 1 active disks, then both F and G must contain an active disk, otherwise there would be a component inside the tape that is not connected to the source.Suppose for contradiction that the active disks of F are false and the active disks of G are true.There is at least one tape block that has no active disk; let T k be such a block, where k is as small as possible.Since δ k 2 has to be covered, it has to be reached either from F or G.
Suppose that δ k 2 is reached through F ; this requires k active disks from the tape blocks.We have only p − 1 − k active disks for the rest of the p − k blocks T k+1 , . . ., T p , so there has to be another empty tape block, T ( > k).As previously demonstrated, we cannot have non-neighboring empty blocks, so the other empty block is T k+1 .This means that δ k 3 also has to be dominated from the left side, the shortest path to which requires k + 1 active tape disks from any false disk of F .This leads to an additional empty block among T k+1 , . . ., T p .But as shown above, there can be at most one such block (T k+1 ) -we arrived at a contradiction.The same argument works for the case when δ k 2 is reached from G.

Gadgets and their connection to tapes and strings
Crossing and branching gadgets.Our crossing gadget and our branching gadget are almost identical to the one used in the W [1]-hardness proof of cds-udg.This gadget can be used to transmit information both horizontally and verticallythis is exactly what we need.Since we only need to transmit truth values, we take the gadget for "n"= 2, resulting in X blocks with 2 • 2 and Y -blocks with 2 • 2 + 1 disks.The only change we make in the crossing gadget is that we swap the X 1 and X 2 blocks.
For the branching gadget, we modify some offsets so that we can transmit the vertical truth value on the right side of our gadget.For this purpose, we redefine the offsets in the following right side X-blocks.offset(X 3 (j)) = (−ι 2 (j), −j) offset(X 4 (j)) = (ι 2 (j), −j) In case of these horizontal connections, we say that a disk X k (j) from the block X k is a true disk if ι 1 (j) = 2 and a false disk if ι 1 (j) = 1.Similarly, for vertical connections, a disk X (j) is a true disk if ι 2 (j) = 2 and a false disk if ι 2 (j) = 1.
Connecting gadgets with tapes and strings.When connecting branching and crossing gadgets or two crossing gadgets with tapes horizontally, we are going to add a tape that goes from the X 4 block of the left gadget to the X 7 block of the right gadget, and a tape that goes from the X 8 block of the right gadget to the X 3 block of the left gadget.Note that in the W[1]-hardness proofs, we used the same strategy with tapes consisting of only one block.In this case, we place the first and last block of each tape at the same location as the connector block in the proof of Theorem 6, and use some tape blocks in between these, the number of which will be specified later.Note that this placement gives us a tape that is consistent with the definition of true and false disks in the X-blocks.
In order to connect strings and side strings to the gadgets, we use both tapes and parent-leaf pairs.Fig. 20 depicts a connection to a crossing gadget from the top and bottom.
We need to connect both "sides" of the string: on the top, we use a tape from X 2 to the last string block, and a tape from the last string block to X 1 .Moreover, in order to make sure that all the disk pairs of the strings are in use, and the connection is not maintained through the tapes, we create a short path to the gadget with some disks that are guaranteed to be in the solution.This path consists of parent and leaf disk pairs, where all the parents will be inside a canonical solution -we used this technique before inside the gadgets to ensure gadget connectivity.The string exits the gadget similarly.Note that the shortest path through the gadget from the string end on the top to the string end on the bottom has length 18, and its internal vertices are all parent disks, a disk from X 1 and a disk from X 5 ; the paths using any of these tapes are longer.
We use the same type of connection to connect side strings to the right side of the last crossing gadget (or to the branching gadget, if the current clause contains the first variable).The complete gadget together with the connections and string turns fits in 50 units of vertical space.(Recall that all distances have been scaled by a factor of two, so that we have unit radius disks.) We briefly return to the tape pairs that connect neighboring blocks.We need to make sure that the tapes do not provide a shortcut -we want the shortest path from source to the last level h to be through string blocks, and to go through gadgets as discussed above.When choosing a tape length, we also need to bridge the distance between neighboring gadgets.Note that this amount can be polynomial in n because of the correction mechanism for strings.We add a small detour to make sure that the shortest path to a gadget that uses a tape is longer than the shortest path that uses only the string that enters the gadget.It is easy to see that there is enough place for such a detour: taking twice the amount of blocks that would be necessary to cover the distance is enough.A tape connection between neighboring blocks is depicted in Fig. 21.(Note that these tapes need no additional vertical space: they fit easily in the 18 units of vertical space between the gadgets.) The clause check gadget.The clause check gadget is very simple, it contains four well-placed disks: one at the end of each of the three side strings, and one disk that only intersects the three other clause check disks.We turn the three side strings towards their corresponding disks so that the side strings do not interfere with each other.Among the six last disks at the end of the three side strings only the ones corresponding to the literals of this clause intersect the gadget.The rest of the side string disks are disjoint from the gadget.See Fig. 22 for an example of checking (x 2 ∨ x 3 ∨ x5 ).The vertical space required is less than 20 units.
Our complete construction can fit in 80 units of vertical space.Ten units can accommodate the lower bundle and turning strings up and down from it;     50 units of vertical space can accommodate the branching and crossing gadgets, along with their connections and tapes.We need ten units for the bundle that goes above the gadgets (along with the string turns), and finally 20 more for the side strings and the clause check gadget.Recall that we did a scaling by two to switch to the intersection model of broadcasting.In the original model of broadcasting, the construction occupies 40 units of vertical space.
In case of a satisfiable formula, we can choose the disks in each side string that correspond to the value of the variable, and choose a disk from the clause check gadget that intersects a true literal (at least one of the literals is true in the clause).
This lemma describes the usage of the clause check gadgets and the side strings.
Lemma 13.Let be the number of true-false disk pairs (blocks) in the three side strings that correspond to a particular clause checking gadget.An h-hop broadcast set contains at least + 1 disks from the three side strings and the clause check gadget.Moreover, if an h-hop broadcast set has exactly + 1 actives among these disks, then the truth values chosen at the beginning of the side strings satisfy the clause.
Proof.We prove the following claim first.
Claim.A side string cannot contain two empty blocks.
Proof of claim.Suppose that U k and U are two empty side string blocks.If they are not neighboring, then a disk between them is unreachable from the source.So = k + 1.Consequently, both disks of U k are dominated from the start of the side string, and both disks of U k+1 are dominated from the end.Since the side string has length at more than four, either k > 2 or k < p − 1. Suppose k > 2, the other case is similar.The only way to reach both disks in U k is to have both of the disks in U k−1 active.Since U k−1 is also reached from the left, there is an active disk in U k−2 ; let its truth value be v.So we can deactivate the disk in U k−1 of value ¬v and activate the disk in U k of value v.This way every disk that has been dominated remains dominated, and the number of active disks does not increase.(Note that we do not need to worry about exceeding h hops since h will be chosen large enough to not interfere with side strings.)Now we show that every h-hop broadcast set includes at least +1 disks from these side strings and the clause check gadget.Suppose there is a side string of p blocks that contains an empty block U k , and let v be the truth value of the disk in the last block (the one intersecting the clause check gadget).Suppose 2 k p − 1; a small variation of the argument applies to the cases k = 1 and k = p.In U k−1 , the disk of value ¬v has to be reached from the beginning of the string -the shortest path requires at least k − 2 active disks in U 1 , . . ., U k−2 .In U k+1 , the disk of value ¬v has to be reached through the clause check gadget; this requires that the clause check disk corresponding to this side string is active, and there are at least p − k side string actives from U k+1 , . . ., U p , since we also need to change truth value along the way.Additionally, the disk of value ¬v in U k has to be reached from one of the neighboring blocks, requiring U k−1 (¬v) or U k+1 (¬v) to be active.Overall, either a side string does not contain an empty block (so it has at least p disks), or we needed k − 2 + (p − k) + 1 + 1 = p active disks from the side string and the corresponding clause check disk.Moreover, at least one of the three side strings needs to connect the middle point of the clause check gadget to the source: the shortest path through a side string of p blocks has p + 1 inner vertices, since it has to include one disk from each block of the side string and the clause check disk corresponding to this side string.Consequently, we need at least + 1 active disks.
Finally, we need to show that if the assignment at the beginning of the side strings does not satisfy the clause (all literals are false), then we need at least + 2 active disks.A similar argument shows that the string that reaches the clause check gadget must have one extra active disk.

Reduction from 3-SAT
Let β be the number of branchings, let γ be the number of crossings, let ξ be the number of disk pairs inside strings and side strings, and let τ be the number of tape blocks in our construction.We examine the disks that are necessarily part of a minimum broadcast set if the formula is satisfiable.It will be apparent that a solution of the same size cannot exist if the formula is not satisfiable.
We include all the disks from the strings and side strings that correspond to the value given to the variable, altogether ξ disks.Add the disks from the gadgets: the blue parent disks inside and one disk from each X-block, altogether 52(β +γ) disks.The branching and crossing gadget connections require four blue parent disks outside the gadget at the top and bottom connection, and two more disks on the last gadget (one per branching), so we require 4(β + γ) + 2β for connections.In each tape we include one disk from all of its blocks except one.The number of tapes that connect neighboring gadgets is 2γ, and we also use 2 tapes per string-gadget connection, so we have 4(β + γ) + 2β such tapes.Thus, the number of tape disks in a solution is τ − (2γ + 4(β + γ) + 2β).Finally, we use one disk to cover each clause check gadget, overall m disks.(Recall that m is the number of clauses.) In case of a satisfiable formula, the total number of disks required for a canonical broadcast set is Proof.As we demonstrated previously, if the formula is satisfiable, then there is an h-hop broadcast set of the given size.We need to show that if there is an h-hop broadcast set of this size, then the formula is satisfiable.Take a minimum h-hop broadcast set.First, we know that the shortest path to the string ending disks requires exactly h hops, and the only path of this length includes all blocks of the string in question, plus the shortest way through the gadgets in which this string is involved.It is easy to check that the shortest way through a gadget from the string end on the top to the string end on the bottom uses only blue disks, and one disk from X 1 and X 5 each.Without loss of generality we can suppose that the h-hop broadcast set restricted to each gadget is canonical by the analogue of Lemma 9. Let t = 2γ + 4(β + γ) + 2β be the number of tapes in the construction.A minimum h-hop broadcast set must include at least τ − t tape disks, and for each clause i, at least i + 1 active disks as shown by Lemmas 12 and 13, where i is the number of blocks in the three side strings that correspond to a clause.So a minimum h-hop broadcast set does indeed require at least C disks.An h-hop broadcast set of this size that is canonical when restricted to each gadget also means that the truth value carried by a string before entering a gadget is the same as the truth value carried after exiting the gadget.Similarly, the truth values are transferred between neighboring gadgets connected by a tape pair: this can be seen by applying Lemma 12 for both tapes.And finally, all clauses must have a true literal at the beginning of at least one of the corresponding side strings by Lemma 13.Since the disk choice at the beginning of a side string is forced to comply with the corresponding string, it follows that the truth values defined by the strings satisfy the formula.
Our construction can be built in polynomial time -note that the coordinates of each point can be represented with O(log n) bits, since a precision of c/n 4 is sufficient.We have successfully reduced 3-SAT to the h-hop broadcast problem in a strip of width 40.Since the problem is trivially in NP, this concludes the proof of Theorem 9.

Conclusion
We studied the complexity of the broadcast problem in narrow and wider strips.For narrow strips we obtained efficient polynomial algorithms, both for the nonhop-bounded and for the h-hop version, thanks to the special structure of the problem inside such strips.On wider strips, the broadcast problem has an n O(w) algorithm, while the h-hop broadcast becomes NP-complete on strips of width 40.With the exception of a constant width range (between √ 3/2 and 40) we characterized the complexity when parameterized by strip width.We have also proved that the planar problem (and, similarly, cds-udg) is W[1]-hard when parameterized by the solution size.The problem of finding a planar h-hop broadcast set seems even harder: we can solve it in polynomial time for h = 2 (see Appendix A) but already for h = 3 we know no better algorithm than brute force.Interesting open problems include: -What is the complexity of planar 3-hop broadcast?In particular, is there a constant value t such that t-hop broadcast is NP-complete?
-What is the complexity of h-hop broadcast in planar graphs?
Observation 12.The region U(D) is star-shaped with respect to the source point s, that is, for any point z in U, the segment sz is inside U(D).
Proof.Let p ∈ D be a point such that z ∈ δ(p).Suppose for contradiction that there is a point t ∈ sz that lies outside U(D), and let be the perpendicular bisector of tz.Since t ∈ δ(p), point p lies on the same side of as z.Note that since t ∈ δ(s), the disk δ(s) is entirely covered by the other half plane of .Thus p ∈ δ(s), which is a contradiction since in a 2-hop broadcast set we have D ⊂ δ(s).
Let ∂U(D) be the boundary of U(D).By the previous observation, ∂U(D) is connected for 2-hop broadcast sets.Note that a point q ∈ Q can be covered by multiple active disks.We will assign a unique point pred (q) ∈ D whose disk covers q to each q ∈ Q, as follows.We call pred (q) the predecessor of q (in the given solution D) because pred (q) can be thought of as the predecessor of q in a broadcast tree induced by D. Let ray(q) be the ray emanating from s and passing through q, and consider the point z where ray(q) exists U(D).Then we define pred (q) to be the point that is the center of the active disk δ on whose boundary z lies (with ties broken arbitrarily, but consistently).
Recall that the points in Q are numbered in angular order around s, and consider the circular sequence σ(D) := pred (q 1 ), . . ., pred (q m ) .We modify σ(D) by replacing any consecutive subsequence consisting of the same point by a single occurrence of that point.For example, we would modify p, p, p, q, q, p, p, r, r, r, p to obtain p, q, p, r, p .Proof.Consider the part of the boundary ∂δ(p) lying outside the source disk δ(s).This boundary part, which we denote by γ, can be partitioned into arcs where ∂δ(p) defines ∂U(D) and arcs where it does not.Assume for a contradiction that there are three arcs where ∂δ(p) defines ∂U(D)-obviously this is necessary for p to appear three times in σ(D).Then there must be two arcs, γ 1 and γ 2 , where ∂δ(p) does not define ∂U(D) and such that γ 1 and γ 2 lie fully in the interior of γ.Let α(γ) denote the opening angle of the cone with apex p defined by γ, and define α(γ 1 ) and α(γ 2 ) similarly; see Fig. 25.It is easy to see that α(γ) 240 • .Since γ 1 and γ 2 do not cover γ completely then one of them, say γ 1 , must be less than 120 • .We will show that this leads to a contradiction, thus proving the lemma.
Let δ(p ) be a disk covering (part of) γ 1 .Since δ(p ) covers less than 120 • of γ 1 , its center p must lie outside δ(p).On the other hand, p must lie inside δ(s),

Fig. 1 .
Fig.1.A swap operation.The edges of the broadcast tree are solid lines.

Lemma 2 .
is covered by δ(s), and our bidirectional disk has to cover points both in (−∞, −1  2 ] × [0, w] and [ 1 2 , ∞) × [0, w].Active disks that are not the source disk and not bidirectional are called monodirectional.For any input P that has a feasible broadcast set, there is a minimum broadcast set D that has one of the following structures.(i) Small: |D| 2.(ii) Path-like: |D| 3, and D consists of a shortest path π − from s to Q − and a shortest path π + from s to Q + ; π + and π − share s and may or may not share their first point after s. (iii) Bidirectional: |D| = 3, and D contains two bidirectional disk centers and s.

3 2 ,Theorem 2 .
x(p) − 1) × [0, w] cannot belong to Q + , since they cannot cover p.It remains to find the points inside the region R = [x(p)−1, x(p)− 1 2 )×[0, w] that belong to Q + .The core of a point in R covers R, so it is sufficient to check whether any given point covers all points in R = [x(p) − 1 2 , x(p)] × [0, w].Thus we need to find the set (R ∩ P ) ∩ p∈R ∩P δ(p) , which can be computed in O(n log n) time by Lemma 4. The broadcast problem inside a strip of width at most √ 3/2 can be solved in O(n log n) time.

Fig. 4 .
Fig. 4. The levels Q + i computed by the algorithm.

Fig. 5 .
Fig. 5. Two different arborescences, with vertices labeled with their level.The red arborescence does not define a feasible broadcast for h = 3, since it would take four hops to reach the top right node.

Fig. 6 .
Fig. 6.Left: A nice Steiner arborescence.Note that arc crossings are possible.Right: Defining the pred function.

Fig. 7 .
Fig. 7.The gadget representing the variables.The red paths form the x2-string.
2 nonempty sets U a,b ⊆ [n] × [n] for 1 a, b k.The goal is to select an element u a,b ∈ U a,b for each 1 a, b k such that -If u a,b = (x, y) and u a+1,b = (x , y ), then x = x .-If u a,b = (x, y) and u a,b+1 = (x , x ), then y = y .

Fig. 9 .
Fig. 9. Circles in a block.The squares intersect every disk in the block.

Fig. 14 .
Fig. 14.A gadget in the final construction.The dashed lines are spanned edges of a canonical dominating set.

Fig. 15 .
Fig. 15.The overall construction, and the way a single clause is checked.Note that in this figure each string (which actually consists of two paths) is shown as a single curve.

Fig. 17 .
Fig.17.A turn of 90 • in a side string or string outside a bundle using constant horizontal space.

Fig. 18 .
Fig. 18.Splitting the top 2 strings off a bundle of 4 strings: we peel the top layers one by one.

Fig. 19 .
Fig. 19.Tape blocks connecting two true-false disk pairs and the corresponding subgraph.

Fig. 20 .
Fig. 20.Connecting to a crossing or branching gadget from the top and bottom.

Fig. 23 .
Fig. 23.The subgraph spanned by the disks of a clause check gadget and its surroundings.

Observation 13 .
In a 2-hop broadcast set D, the boundary sequence σ(D) has no cyclic subsequence• • • p • • • p • • • p • • • p with p = p .Proof.Between two adjacent occurrences of p and p on the boundary, there must be an intersection between p and p .Since there can be at most two intersections between two circles, the sequence• • • p • • • p • • • p • • • p cannot occur in σ.Lemma 14.In a 2-hop broadcast set D, any point p ∈ D can appear in σ(D) at most twice.
3.In O(n log n) time we can find a bidirectional broadcast if it exists.Proof.Let P − := {u 1 , u 2 , . . ., u k } be the set of points to the left of the source disk δ(s), where the points are sorted in increasing y-order with ties broken arbitrarily.Similarly, let P + := {v 1 , v 2 , . . ., v l } be the set of points to the right of δ(s), again sorted in order of increasing y-coordinate.Define P − 4. Let P and Q be two point sets in R 2 .Then both Q ∩ has more than i hops.Let p be a bad vertex of highest level among the bad vertices.If i = h, then the broadcast set is infeasible, thus i h − 1.If p ∈ L h−1 , then the shortest s → p path in G[D]must have length h, consequently, p cannot be used in an h-hop path to any other point.Therefore, p can be deactivated.(Notethat p itself remains covered since it was reachable in the first place.)Ifp is on a lower level, then let π q be a shortest path in G[D] going to the last level, and let q Theorem 4. The one-sided h-hop broadcast problem inside a strip of width at most √ 3/2 can be solved in O(n 4 ) time.Proof.By our lemmas, we know that our solution can be categorized as path-like or as arborescence-based.We compute the best path-like solution by invoking the second part of our narrow strip broadcast algorithm, which runs in O(n log n) time.The output of this algorithm is a path with t or t + 1 hops (where t is the number of levels); thus, it is a minimum h-hop broadcast set if t < h, or if t = h and the path has length h.Otherwise there is no path-like h-hop broadcast set, so an arborescence defines a minimum h-hop broadcast set by Lemma 6.By Lemma 8, it is sufficient to look for a nice Steiner arborescence, and take the broadcast set defined by it.