{"paper":{"title":"The Homogeneous Broadcast Problem in Narrow and Wide Strips","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.CG","authors_text":"Hans L. Bodlaender, Mark de Berg, S\\'andor Kisfaludi-Bak","submitted_at":"2017-05-03T14:48:56Z","abstract_excerpt":"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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01465","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}