Graphic Submodular Function Minimization: A Graphic Approach and Applications
From MaRDI portal
Publication:2971617
DOI10.1007/978-3-540-76796-1_17zbMath1359.05127OpenAlexW10594787MaRDI QIDQ2971617
András Sebő, Myriam Preissmann
Publication date: 7 April 2017
Published in: Research Trends in Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76796-1_17
Related Items
A bilevel programming problem with maximization of a supermodular function in the lower level, Optimal hierarchical clustering on a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Testing membership in matroid polyhedra
- Generalized polymatroids and submodular flows
- The ellipsoid method and its consequences in combinatorial optimization
- Submodular functions and optimization
- Separating from the dominant of the spanning tree polytope
- Geometric algorithms and combinatorial optimization
- A faster algorithm for computing the strength of a network
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A fully combinatorial algorithm for submodular function minimization.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Network reinforcement
- Separation of Partition Inequalities
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- Maximal Flow Through a Network
- Trees and Cuts
- Optimal attack and reinforcement of a network
- A new approach to the maximum-flow problem
- Selected Applications of Minimum Cuts in Networks
- Computing the Strength of a Graph
- Algorithms for Graphic Polymatroids and Parametrics-Sets
- Optimal cooperation and submodularity for computing Potts partition functions with a large number of states
- A Fast Parametric Maximum Flow Algorithm and Applications
- Lehmans switching game and a theorem of Tutte and Nash-Williams
- Matroids and the greedy algorithm
