Unverified50% confidenceFactExact time
The capacitated cluster editing problem is NP-hard when there is no capacity constraint, and it has been proven to be APX-hard.
1
Sources
50%
Confidence
Long-term
Relevance
11/5/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedPCB布局(Placement)本质上是一个NP难的组合优化问题68% similarUnverifiedThe bin packing problem is NP-hard, and exhaustively enumerating all solutions becomes computationally infeasible as the scale grows67% similarUnverified整数规划(IP)因引入离散变量使解空间组合爆炸,属于NP难问题65% similarUnverifiedQAP has been proven to be NP-hard, and even instances of size n=30 can be intractable for exact solving algorithms.63% similarUnverified中心化多MCP架构在工具数量增多时存在不稳定性、可扩展性差和工具调用混乱的问题61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1137779API
curl https://kongchang.com/api/v1/knowledge/claims/1137779MCP
get_claim(id=1137779)