Unverified50% confidenceFactExact time
The capacitated cluster editing problem takes as input a complete signed edge graph, and the goal is to construct a set of disjoint cliques of size no greater than a given k such that the total number of negative edges inside cliques plus positive edges outside cliques is minimized.
1
Sources
50%
Confidence
Long-term
Relevance
11/5/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedFor graphs with small integer edge weights, Dial's Algorithm (a bucket-sort approach) can reduce the complexity to O(m + C), where C is the maximum edge weight.69% similarUnverifiedThe output space of a classification problem is a set of finite, unordered, mutually exclusive labels.65% similarUnverifiedCurrent mainstream 4-bit quantization schemes (such as GPTQ and AWQ) universally adopt a group quantization strategy with group size=128.65% similarUnverifiedThe Classification of Finite Simple Groups (CFSG) asserts that all finite simple groups fall into the infinite families of cyclic groups of prime order, alternating groups, and groups of Lie type, plus the 26 sporadic simple groups.63% similarUnverifiedIn secure aggregation, a finite group usually refers to the additive group Z_p formed by integers modulo a prime p.63% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1137782API
curl https://kongchang.com/api/v1/knowledge/claims/1137782MCP
get_claim(id=1137782)