Unverified50% confidenceFactExact time
For heterogeneous asynchronous MMAB, a polynomial-time greedy algorithm can achieve a 1/e approximation ratio relative to the optimal centralized assignment.
1
Sources
50%
Confidence
Long-term
Relevance
10/14/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedIn heterogeneous asynchronous MMAB, if players are processed in decreasing order of their activation probabilities, the approximation ratio of the greedy algorithm can be improved to 1/√e.77% similarUnverifiedA greedy approximation strategy for solving the dominating set can be completed in polynomial time, and its solution size is at most O(ln n) times the optimal solution.72% similarUnverifiedOOSM处理的Algorithm A是单步延迟最优算法，通过增广状态向量在不存储历史数据情况下精确处理单步延迟，Algorithm B是计算开销更小的近似版本69% similarUnverifiedMany asymptotically superior algorithms, due to large hidden constant factors or implementation complexity, actually perform worse than highly optimized Dijkstra or A* at real-world data scales.67% similarUnverifiedWhen using exact rational arithmetic, the bit length of intermediate rational numbers in the classical LLL algorithm can reach O(n·β) in the worst case, with an overall complexity of O(n⁵·β³) or even higher.67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1023898API
curl https://kongchang.com/api/v1/knowledge/claims/1023898MCP
get_claim(id=1023898)