{"paper":{"title":"Improved Local Search Based Approximation Algorithm for Hard Uniform Capacitated k-Median Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aditya Pancholi, Neelima Gupta","submitted_at":"2018-04-24T10:47:18Z","abstract_excerpt":"In this paper, we study the hard uniform capacitated $k$- median problem using local search heuristic. Obtaining a constant factor approximation for the \\ckm problem is open. All the existing solutions giving constant-factor approximation, violate at least one of the cardinality and the capacity constraints. All except Koruplou et al are based on LP-relaxation.\n  We give $(3+\\epsilon)$ factor approximation algorithm for the problem violating the cardinality by a factor of $8/3 \\approx 2.67$. There is a trade-off between the approximation factor and the cardinality violation between our work an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08948","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"}