Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism

Artificial Intelligence 314 (C):103819 (2023)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,783

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

確率的制約充足アルゴリズムにおける局所最適構造.西原 清一 水野 一徳 - 2001 - Transactions of the Japanese Society for Artificial Intelligence 16:38-45.
Domatic partitions of computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2014 - Archive for Mathematical Logic 53 (1-2):137-155.
構文解析にもとづく規則生成と規則集合探索による文脈自由文法の漸次学習.保科 明美 中村 克彦 - 2006 - Transactions of the Japanese Society for Artificial Intelligence 21 (4):371-379.

Analytics

Added to PP
2022-11-21

Downloads
11 (#1,133,540)

6 months
7 (#421,763)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations