{"paper":{"title":"Dynamic Programming Optimization in Line of Sight Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michele Zito, Pavan Sangha, Prudence W. H. Wong","submitted_at":"2018-06-05T09:38:34Z","abstract_excerpt":"Line of Sight (LoS) networks were designed to model wireless communication in settings which may contain obstacles restricting node visibility. For fixed positive integer $d$, and positive integer $\\omega$, a graph $G=(V,E)$ is a ($d$-dimensional) LoS network with range parameter $\\omega$ if it can be embedded in a cube of side size $n$ of the $d$-dimensional integer grid so that each pair of vertices in $V$ are adjacent if and only if their embedding coordinates differ only in one position and such difference is less than $\\omega$.\n  In this paper we investigate a dynamic programming (DP) app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01581","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"}