{"paper":{"title":"Improved Approximation Guarantees for Lower-Bounded Facility Location","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Chaitanya Swamy, Sara Ahmadian","submitted_at":"2011-04-15T19:15:21Z","abstract_excerpt":"We consider the {\\em lower-bounded facility location} (\\lbfl) problem (also sometimes called {\\em load-balanced facility location}), which is a generalization of {\\em uncapacitated facility location} (\\ufl), where each open facility is required to serve a certain {\\em minimum} amount of demand. More formally, an instance $\\I$ of \\lbfl is specified by a set $\\F$ of facilities with facility-opening costs $\\{f_i\\}$, a set $\\D$ of clients, and connection costs $\\{c_{ij}\\}$ specifying the cost of assigning a client $j$ to a facility $i$, where the $c_{ij}$s form a metric. A feasible solution specif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3128","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"}