A Note on Submodular Function Minimization with Covering Type Linear Constraints

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In this paper, we consider the non-negative submodular function minimization problem with covering type linear constraints. Assume that there exist m linear constraints, and we denote by Δi the number of non-zero coefficients in the ith constraints. Furthermore, we assume that Δ1≥ Δ2≥ ⋯ ≥ Δm. For this problem, Koufogiannakis and Young proposed a polynomial-time Δ1-approximation algorithm. In this paper, we propose a new polynomial-time primal-dual approximation algorithm based on the approximation algorithm of Takazawa and Mizuno for the covering integer program with { 0 , 1 } -variables and the approximation algorithm of Iwata and Nagano for the submodular function minimization problem with set covering constraints. The approximation ratio of our algorithm is max { Δ2, min { Δ1, 1 + Π} } , where Π is the maximum size of a connected component of the input submodular function.

Original languageEnglish
Pages (from-to)2957-2971
Number of pages15
JournalAlgorithmica
Volume80
Issue number10
DOIs
Publication statusPublished - Oct 1 2018

Fingerprint

Function Minimization
Submodular Function
Approximation algorithms
Linear Constraints
Approximation Algorithms
Covering
Minimization Problem
Polynomial time
Polynomials
Primal-dual Algorithm
Set Covering
Integer Program
Connected Components
Non-negative
Denote
Coefficient
Approximation

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Computer Science Applications
  • Applied Mathematics

Cite this

A Note on Submodular Function Minimization with Covering Type Linear Constraints. / Kamiyama, Naoyuki.

In: Algorithmica, Vol. 80, No. 10, 01.10.2018, p. 2957-2971.

Research output: Contribution to journalArticle

@article{37a4013560d243c288f7d7ef58f638e0,
title = "A Note on Submodular Function Minimization with Covering Type Linear Constraints",
abstract = "In this paper, we consider the non-negative submodular function minimization problem with covering type linear constraints. Assume that there exist m linear constraints, and we denote by Δi the number of non-zero coefficients in the ith constraints. Furthermore, we assume that Δ1≥ Δ2≥ ⋯ ≥ Δm. For this problem, Koufogiannakis and Young proposed a polynomial-time Δ1-approximation algorithm. In this paper, we propose a new polynomial-time primal-dual approximation algorithm based on the approximation algorithm of Takazawa and Mizuno for the covering integer program with { 0 , 1 } -variables and the approximation algorithm of Iwata and Nagano for the submodular function minimization problem with set covering constraints. The approximation ratio of our algorithm is max { Δ2, min { Δ1, 1 + Π} } , where Π is the maximum size of a connected component of the input submodular function.",
author = "Naoyuki Kamiyama",
year = "2018",
month = "10",
day = "1",
doi = "10.1007/s00453-017-0363-8",
language = "English",
volume = "80",
pages = "2957--2971",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer New York",
number = "10",

}

TY - JOUR

T1 - A Note on Submodular Function Minimization with Covering Type Linear Constraints

AU - Kamiyama, Naoyuki

PY - 2018/10/1

Y1 - 2018/10/1

N2 - In this paper, we consider the non-negative submodular function minimization problem with covering type linear constraints. Assume that there exist m linear constraints, and we denote by Δi the number of non-zero coefficients in the ith constraints. Furthermore, we assume that Δ1≥ Δ2≥ ⋯ ≥ Δm. For this problem, Koufogiannakis and Young proposed a polynomial-time Δ1-approximation algorithm. In this paper, we propose a new polynomial-time primal-dual approximation algorithm based on the approximation algorithm of Takazawa and Mizuno for the covering integer program with { 0 , 1 } -variables and the approximation algorithm of Iwata and Nagano for the submodular function minimization problem with set covering constraints. The approximation ratio of our algorithm is max { Δ2, min { Δ1, 1 + Π} } , where Π is the maximum size of a connected component of the input submodular function.

AB - In this paper, we consider the non-negative submodular function minimization problem with covering type linear constraints. Assume that there exist m linear constraints, and we denote by Δi the number of non-zero coefficients in the ith constraints. Furthermore, we assume that Δ1≥ Δ2≥ ⋯ ≥ Δm. For this problem, Koufogiannakis and Young proposed a polynomial-time Δ1-approximation algorithm. In this paper, we propose a new polynomial-time primal-dual approximation algorithm based on the approximation algorithm of Takazawa and Mizuno for the covering integer program with { 0 , 1 } -variables and the approximation algorithm of Iwata and Nagano for the submodular function minimization problem with set covering constraints. The approximation ratio of our algorithm is max { Δ2, min { Δ1, 1 + Π} } , where Π is the maximum size of a connected component of the input submodular function.

UR - http://www.scopus.com/inward/record.url?scp=85028537386&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85028537386&partnerID=8YFLogxK

U2 - 10.1007/s00453-017-0363-8

DO - 10.1007/s00453-017-0363-8

M3 - Article

AN - SCOPUS:85028537386

VL - 80

SP - 2957

EP - 2971

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

IS - 10

ER -