Unverified50% confidenceFactExact time
The paper proposes a size-reduction procedure that, based on an α-approximation algorithm for the arbitrary uncapacitated problem, constructs an α_k=2α+1 approximation algorithm for the capacitated problem.
1
Sources
50%
Confidence
Long-term
Relevance
11/5/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedInformation-theoretic lower bounds characterize the best performance achievable by any algorithm (even exponential-time) without computational resource constraints, corresponding in this problem to Õ(md+k); computational lower bounds, by contrast, assume the algorithm must run in polynomial time, and the resulting bounds are usually larger.68% similarUnverifiedAlgorithm selection must match the nature of the problem: gradient descent is suited for smooth, differentiable, continuous optimization, while gradient-free methods are suited for discrete, step-wise, or highly noisy objective functions.67% similarUnverified补偿求和算法(Kahan Summation Algorithm)于1965年提出,可将N个数求和的误差从O(N·ε)降低到O(ε)级别67% similarUnverifiedOOSM 除回溯重放外还有 Algorithm A(用当前增益近似处理)和 Algorithm B(基于储存协方差进行精确后验修正)等方案,各有计算复杂度与精度权衡66% similarUnverifiedThis lower bound is proven by constructing an adversarial environment in which the loss sequence is dynamically adjusted based on the algorithm's output, forcing the algorithm to explore.65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1137784API
curl https://kongchang.com/api/v1/knowledge/claims/1137784MCP
get_claim(id=1137784)