Skip to main content
Journal ArticleOPEN ACCESS

A fully combinatorial algorithm for submodular function minimization

Journal of Combinatorial Theory. Series B (2002) 84(2) 203-212
DOI: 10.1006/jctb.2001.2072
N/ACitations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a strongly polynomial algorithm for submodular function minimization using only additions, subtractions, comparisons, and oracle calls for function values. © 2001 Elsevier Science (USA).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Iwata, S. (2002). A fully combinatorial algorithm for submodular function minimization. Journal of Combinatorial Theory. Series B, 84(2), 203–212. https://doi.org/10.1006/jctb.2001.2072

Readers over time

‘10‘11‘12‘14‘17‘18‘19‘20‘2101234

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 7

58%

Professor / Associate Prof. 3

25%

Researcher 2

17%

Readers' Discipline

Tooltip

Computer Science 5

45%

Mathematics 5

45%

Agricultural and Biological Sciences 1

9%

Save time finding and organizing research with Mendeley

Sign up for free
0