Graphic Submodular Function Minimization: A Graphic Approach and Applications

Myriam Preissmann () and András Sebő ()
Additional contact information
Myriam Preissmann: CNRS, INPG, UJF, Laboratoire G-SCOP
András Sebő: CNRS, INPG, UJF, Laboratoire G-SCOP

Chapter 17 in Research Trends in Combinatorial Optimization, 2009, pp 365-385 from Springer

Abstract: Summary In this paper we study particular submodular functions that we call “graphic”. A graphic submodular function is defined on the edge set E of a graph G=(V,E) and is equal to the sum of the rank-function of G and of a linear function on E. Several polynomial algorithms are known that can be used to minimize graphic submodular functions and some were adapted to an equivalent problem called “Optimal Attack” by Cunningham. We collect eight different algorithms for this problem, including a recent one (initially developed for solving a problem for physics): it consists of |V|−1 steps, where the i-th step requires the solution of a network flow problem on a subgraph (with slight modifications) induced by at most i vertices of the given graph (i=2,…,|V|). This is a fully combinatorial algorithm for this problem: contrary to its predecessors, neither the algorithm nor its proof of validity use directly linear programming or keep any kind of dual solution. The approach is direct and conceptually simple, with the same worst case asymptotic complexity as the previous ones. Motivated by applications, we also show how this combinatorial approach to graphic submodular function minimization provides efficient solution methods for several problems of combinatorial optimization and physics.

Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-76796-1_17

Ordering information: This item can be ordered from
http://www.springer.com/9783540767961

DOI: 10.1007/978-3-540-76796-1_17

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().