Submodular function minimization with submodular set covering constraints and precedence constraints

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we consider the submodular function minimization problem with submodular set covering constraints and precedence constraints, and we prove that the algorithm of McCormick, Peis, Verschae, and Wierz for the precedence constrained covering problem can be generalized to our setting.

Original languageEnglish
Title of host publicationApproximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers
EditorsRoberto Solis-Oba, Rudolf Fleischer
PublisherSpringer Verlag
Pages90-101
Number of pages12
ISBN (Print)9783319894409
DOIs
Publication statusPublished - Jan 1 2018
Event15th Workshop on Approximation and Online Algorithms, WAOA 2017 - Vienna, Austria
Duration: Sep 7 2017Sep 8 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10787 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other15th Workshop on Approximation and Online Algorithms, WAOA 2017
CountryAustria
CityVienna
Period9/7/179/8/17

Fingerprint

Function Minimization
Submodular Function
Set Covering
Precedence Constraints
Covering Problem
Minimization Problem

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kamiyama, N. (2018). Submodular function minimization with submodular set covering constraints and precedence constraints. In R. Solis-Oba, & R. Fleischer (Eds.), Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers (pp. 90-101). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10787 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-89441-6_8

Submodular function minimization with submodular set covering constraints and precedence constraints. / Kamiyama, Naoyuki.

Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers. ed. / Roberto Solis-Oba; Rudolf Fleischer. Springer Verlag, 2018. p. 90-101 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10787 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kamiyama, N 2018, Submodular function minimization with submodular set covering constraints and precedence constraints. in R Solis-Oba & R Fleischer (eds), Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10787 LNCS, Springer Verlag, pp. 90-101, 15th Workshop on Approximation and Online Algorithms, WAOA 2017, Vienna, Austria, 9/7/17. https://doi.org/10.1007/978-3-319-89441-6_8
Kamiyama N. Submodular function minimization with submodular set covering constraints and precedence constraints. In Solis-Oba R, Fleischer R, editors, Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers. Springer Verlag. 2018. p. 90-101. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-89441-6_8
Kamiyama, Naoyuki. / Submodular function minimization with submodular set covering constraints and precedence constraints. Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers. editor / Roberto Solis-Oba ; Rudolf Fleischer. Springer Verlag, 2018. pp. 90-101 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{24b30760e9ba4c60a96d6376981cef2a,
title = "Submodular function minimization with submodular set covering constraints and precedence constraints",
abstract = "In this paper, we consider the submodular function minimization problem with submodular set covering constraints and precedence constraints, and we prove that the algorithm of McCormick, Peis, Verschae, and Wierz for the precedence constrained covering problem can be generalized to our setting.",
author = "Naoyuki Kamiyama",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-89441-6_8",
language = "English",
isbn = "9783319894409",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "90--101",
editor = "Roberto Solis-Oba and Rudolf Fleischer",
booktitle = "Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers",
address = "Germany",

}

TY - GEN

T1 - Submodular function minimization with submodular set covering constraints and precedence constraints

AU - Kamiyama, Naoyuki

PY - 2018/1/1

Y1 - 2018/1/1

N2 - In this paper, we consider the submodular function minimization problem with submodular set covering constraints and precedence constraints, and we prove that the algorithm of McCormick, Peis, Verschae, and Wierz for the precedence constrained covering problem can be generalized to our setting.

AB - In this paper, we consider the submodular function minimization problem with submodular set covering constraints and precedence constraints, and we prove that the algorithm of McCormick, Peis, Verschae, and Wierz for the precedence constrained covering problem can be generalized to our setting.

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

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

U2 - 10.1007/978-3-319-89441-6_8

DO - 10.1007/978-3-319-89441-6_8

M3 - Conference contribution

AN - SCOPUS:85045962291

SN - 9783319894409

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 90

EP - 101

BT - Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers

A2 - Solis-Oba, Roberto

A2 - Fleischer, Rudolf

PB - Springer Verlag

ER -