[KongchangAI]
Unverified50% confidenceFactExact time

对于单调次模函数最大化问题,简单贪心算法可获得 (1−1/e)≈0.632 的最优多项式时间近似比,该结果由Nemhauser等人于1978年证明

1
Sources
50%
Confidence
Long-term
Relevance
7/15/2026
First Seen

Sources

Related Claims

Cite This Claim

Stable URI
https://kongchang.com/claim/519211
API
curl https://kongchang.com/api/v1/knowledge/claims/519211
MCP
get_claim(id=519211)