[KongchangAI]
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

Cite This Claim

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