{"paper":{"title":"Approximating Soft-Capacitated Facility Location Problem With Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shuxin Cai, Wenguo Yang, Yaohua Tang","submitted_at":"2012-07-02T03:22:06Z","abstract_excerpt":"We first show that a better analysis of the algorithm for The Two-Sage Stochastic Facility Location Problem from Srinivasan \\cite{sri07} and the algorithm for The Robust Fault Tolerant Facility Location Problem from Byrka et al \\cite{bgs10} can render improved approximation factors of 2.206 and \\alpha+4 where \\alpha is the maximum number an adversary can close, respectively, and which are the best ratios so far.\n  We then present new models for the soft-capacitated facility location problem with uncertainty and design constant factor approximation algorithms to solve them. We devise the stocha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0271","kind":"arxiv","version":3},"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"}