请输入您要查询的字词:
单词
set cover algorithm
释义
set cover algorithm
Encyclopedia
理学
组合算法
释
set cover algorithm
集合覆盖算法
集合覆盖算法是求解集合覆盖问题的算法。集合覆盖问题(set cover problem,简称SCP)是计算机科学、组合数学以及计算复杂性理论中的重要问题。集合覆盖问题的形式化定义如下:给定一个全集以及集合,其中,覆盖(cover)是指一个集合,其中且包含的所有元素的并集为;集合覆盖的判定(Decision)问题为:给定和以及整数,判断是否存在势(Cardinality)小于或者等于的覆盖;集合覆盖的优化(Optimization)问题为:给定和,求一个势最小的覆盖。
随便看
The Chuanqi Story of Wu Dexiu
The Chuanqi Story of Zhen Lin and Wang Loubing
The Chubbchubbs!
the Church of the Nativity of Our Lady of Zvenigorod
The Church of the Tithes
The CILIP Carnegie Medal
the circular economy promotion Law
The Citizen
The City and the Grassroots
the city beautiful movement in Washington, D.C.
the city bid rent curve
The City: Its Development,Decline,and Future
The City: Its Growth, Its Decay, Its Future
The City of Nanjing
The City of Riot
The City of Tomorrow and Its Planning
The City Plan of Nanking
The City: Suggestions for the Study of Human Nature in the Urban Environment
thecium
the civil accepting and hearing
The Civil Code of the Soviet Union in 1922
The Civil Code of the Soviet Union in 1964
The Civilizing Process
The civil rights movement
The Civil War in France
科学参考收录了854744条科技类词条,基本涵盖了常见科技类参考文献及英语词汇的翻译,是科学学习和研究的有利工具。
Copyright © 2000-2023 Sciref.net All Rights Reserved
京ICP备2021023879号
更新时间:2026/7/27 7:27:48