当前位置: X-MOL 学术arXiv.cs.DS › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On combinatorial optimization for dominating sets (literature survey, new models)
arXiv - CS - Data Structures and Algorithms Pub Date : 2020-09-19 , DOI: arxiv-2009.09288
Mark Sh. Levin

The paper focuses on some versions of connected dominating set problems: basic problems and multicriteria problems. A literature survey on basic problem formulations and solving approaches is presented. The basic connected dominating set problems are illustrated by simplifyed numerical examples. New integer programming formulations of dominating set problems (with multiset estimates) are suggested.

中文翻译:

关于支配集的组合优化(文献调查,新模型)

这篇论文侧重于连接支配集问题的一些版本:基本问题和多标准问题。介绍了关于基本问题表述和解决方法的文献调查。通过简化的数值例子说明了基本的连通支配集问题。建议了主导集问题(具有多集估计)的新整数规划公式。
更新日期:2020-09-22
down
wechat
bug