{"paper":{"title":"Constrained Orthogonal Segment Stabbing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.CG","authors_text":"Saeed Mehrabi, Sayan Bandyapadhyay","submitted_at":"2019-04-30T17:04:08Z","abstract_excerpt":"Let $S$ and $D$ each be a set of orthogonal line segments in the plane. A line segment $s\\in S$ \\emph{stabs} a line segment $s'\\in D$ if $s\\cap s'\\neq\\emptyset$. It is known that the problem of stabbing the line segments in $D$ with the minimum number of line segments of $S$ is NP-hard. However, no better than $O(\\log |S\\cup D|)$-approximation is known for the problem. In this paper, we introduce a constrained version of this problem in which every horizontal line segment of $S\\cup D$ intersects a common vertical line. We study several versions of the problem, depending on which line segments "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.13369","kind":"arxiv","version":2},"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"}