首页>
外国专利>
METHOD AND SYSTEM FOR SOLVING A MINIMUM CONNECTED DOMINATING SET PROBLEM USING QUANTUM ANNEALING FOR DISTANCE OPTIMIZATION AND USE THEREOF
METHOD AND SYSTEM FOR SOLVING A MINIMUM CONNECTED DOMINATING SET PROBLEM USING QUANTUM ANNEALING FOR DISTANCE OPTIMIZATION AND USE THEREOF
展开▼
机译:使用量子退火求解最小连接域集合问题的方法和系统及其优化方法
展开▼
页面导航
摘要
著录项
相似文献
摘要
A method and an apparatus are disclosed for determining a minimum connected dominating set in a graph, the method comprising obtaining an indication of an input graph, the input graph comprising a plurality of nodes and a plurality of edges; generating a distance table comprising for each node of the input graph, an indication of a distance between the given node and each of the other nodes of the plurality of nodes; generating a corresponding constrained binary quadratic programming problem using the generated distance table; providing the corresponding constrained binary quadratic programming problem to a quantum annealing solver; obtaining at least one approximate solution from the quantum annealing solver; post-processing the at least one approximate solution and providing the post-processed at least one approximate solution.
展开▼