Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
The vertex separation number of a graph equals its path-width
Information Processing Letters
A note on minimizing submodular functions
Information Processing Letters
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
Graph Minors. XX. Wagner's conjecture
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Submodular function minimization
Mathematical Programming: Series A and B
Algorithmic Aspects of Graph Connectivity
Algorithmic Aspects of Graph Connectivity
A faster strongly polynomial time algorithm for submodular function minimization
Mathematical Programming: Series A and B
Algorithmica - Special Issue: Algorithms and Computation; Guest Editor: Takeshi Tokuyama
A polynomial time algorithm for bounded directed pathwidth
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Hi-index | 0.00 |
In this paper, we present a submodular minimization algorithm based on a new relationship between minimizers of a submodular set function and pathwidth defined on submodular set functions. Given a submodular set function f on a finite set V with n ≥2 elements and an ordered pair s ,t ∈V , let λ s ,t denote the minimum f (X ) over all sets X with s ∈X ⊆V −{t }. The pathwidth Λ(σ ) of a sequence σ of all n elements in V is defined to be the maximum f (V (σ ′)) over all nonempty and proper prefixes σ ′ of σ , where V (σ ′) denotes the set of elements occurred in σ ′. The pathwidth Λs ,t of f from s to t is defined to be the minimum pathwidth Λ(σ ) over all sequences σ of V which start with element s and end up with t . Given a real k ≥f ({s }), our algorithm checks whether Λs ,t ≤k or not and computes λ s ,t (when Λs ,t ≤k ) in O (n Δ(k )+1) oracle-time, where Δ(k ) is the number of distinct values of f (X ) with f (X )≤k overall sets X with s ∈X ⊆V −{t }.