arXiv (All)
open access
Simpler Algorithms for Capacitated $k$-Median with $(1 + ε)$-Violations Using New Inequalities
We revisit the capacitated $k$-median problem, focusing on constant-factor approximation algorithms with either $(1+ε)$-cardinality or capacity violations. Previous results [DemirciL16, Li16} achieve an $O_ε(1)$-approximation with $(1+ε)$-violations via complex extended configuration linear programm
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Infra-Medians#40578
- Theory and algorithms on the median graph : application to graph-based classification and clustering#367041
- An artificial immune system algorithm for solving the uncapacitated single allocation p-Hub median problem#312083
- A Deterministic $0.401$-Approximation for Non-monotone Submodular Maximization under Matroid Constraints#1341669
- Approximation algorithms for the square min-sum bin packing problem#925016
Record · ID 1387626
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive