Unverified50% confidenceFactExact time
Prim最小生成树算法（1957年）和Dijkstra最短路径算法（1959年）是贪心思想的早期应用
1
Sources
50%
Confidence
Long-term
Relevance
7/6/2026
First Seen
Sources
Greedy Algorithms and the Knapsack Problem: Core Notes from MIT 6.0002 Lecture 1
bilibiliAI从零开始学7/3/2026
Related Claims
UnverifiedThe Sequential Minimal Optimization algorithm (SMO) was proposed by John Platt in 1998, decomposing large-scale quadratic programming problems into minimal sub-problems involving only two variables.64% similarUnverified该方案选用小而快的检索模型，重建索引不到一秒，属于选择速度而非完美的权衡56% similarUnverifiedThe Grisu algorithm can quickly generate the shortest representation in most cases, but still has approximately 0.5% of difficult cases that require falling back to a slow path.55% similarUnverifiedSugiyama算法第二步的最小化边交叉被证明是NP完全问题，由Garey和Johnson在1983年证明即使两层情况下最小化交叉数也是NP难的55% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/114323API
curl https://kongchang.com/api/v1/knowledge/claims/114323MCP
get_claim(id=114323)