{"paper":{"title":"A Super-Fast Distributed Algorithm for Bipartite Metric Facility Location","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"James Hegeman, Sriram V. Pemmaraju","submitted_at":"2013-08-12T20:45:17Z","abstract_excerpt":"The \\textit{facility location} problem consists of a set of \\textit{facilities} $\\mathcal{F}$, a set of \\textit{clients} $\\mathcal{C}$, an \\textit{opening cost} $f_i$ associated with each facility $x_i$, and a \\textit{connection cost} $D(x_i,y_j)$ between each facility $x_i$ and client $y_j$. The goal is to find a subset of facilities to \\textit{open}, and to connect each client to an open facility, so as to minimize the total facility opening costs plus connection costs. This paper presents the first expected-sub-logarithmic-round distributed O(1)-approximation algorithm in the $\\mathcal{CONG"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2694","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"}