Scholarlink

Usually, non-submodular optimization problems are NP-hard. Therefore, design and analysis of approximation algorithms are important tasks in the study of non-submodular optimizations. However, the traditional methods do not work well. In this article, we give an extensive survey for recent developments in this research direction.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Non-submodular Optimization and Non-convex Relaxation

  • 章节

  • 发表日期：

    2025年

查看全文
  • Weili Wu,
  • Zhao Zhang,
  • Wei Li,
  • Ding-Zhu Du

摘要

Usually, non-submodular optimization problems are NP-hard. Therefore, design and analysis of approximation algorithms are important tasks in the study of non-submodular optimizations. However, the traditional methods do not work well. In this article, we give an extensive survey for recent developments in this research direction.