{"paper":{"title":"Improved Randomized Rounding using Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sandeep Sen","submitted_at":"2014-08-03T12:10:32Z","abstract_excerpt":"We describe a novel algorithm for rounding packing integer programs based on multidimensional Brownian motion in $\\mathbb{R}^n$. Starting from an optimal fractional feasible solution $\\bar{x}$, the procedure converges in polynomial time to a distribution over (possibly infeasible) point set $P \\subset {\\{0,1 \\}}^n$ such that the expected value of any linear objective function over $P$ equals the value at $\\bar{x}$. This is an alternate approach to the classical randomized rounding method of Raghavan and Thompson \\cite{RT:87}.\n  Our procedure is very general and in conjunction with discrepancy "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0488","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"}