A note on the minimization of symmetric and general submodular functions

DOI10.1016/S0166-218X(02)00470-5zbMath1030.90103OpenAlexW2139343374MaRDI QIDQ1410698

H. Narayanan

Publication date: 14 October 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00470-5

zbMATH Keywords

MinimizationConvexSymmetric submodular

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms ⋮ Source location in undirected and directed hypergraphs

Cites Work

• Unnamed Item
• A note on minimizing submodular functions
• A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
• Minimizing symmetric submodular functions
• Submodular functions and electrical networks
• Implementing an efficient minimum capacity cut algorithm
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
• A simple min-cut algorithm

This page was built for publication: A note on the minimization of symmetric and general submodular functions