{"paper":{"title":"On Packing Almost Half of a Square with Anchored Rectangles: A Constructive Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Arijit Bishnu, Aritra Banik, Bhargab B. Bhattacharya, Sandip Banerjee, Soumyottam Chatterjee","submitted_at":"2013-12-31T07:54:16Z","abstract_excerpt":"In this paper, we consider the following geometric puzzle whose origin was traced to Allan Freedman \\cite{croft91,tutte69} in the 1960s by Dumitrescu and T{\\'o}th \\cite{adriancasaba2011}. The puzzle has been popularized of late by Peter Winkler \\cite{Winkler2007}. Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. The problem is to construct $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each rectangle coincides with a point in $P_{n}$ and the total area covered by the rectangles is maximized. We would "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0108","kind":"arxiv","version":4},"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"}