scientific article; zbMATH DE number 7051294
From MaRDI portal
Publication:4633938
zbMath1423.90226MaRDI QIDQ4633938
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496903
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (18)
Tractability in constraint satisfaction problems: a survey ⋮ Submodular Functions: Learnability, Structure, and Optimization ⋮ Minimizing submodular functions on diamonds via generalized fractional matroid matchings ⋮ Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function ⋮ Efficient Solution Methods for a General r-Interdiction Median Problem with Fortification ⋮ Hypergraph Cuts with General Splitting Functions ⋮ Algorithms for single machine scheduling problem with release dates and submodular penalties ⋮ Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph ⋮ The Complexity of Valued CSPs ⋮ A framework of discrete DC programming by discrete convex analysis ⋮ The expressive power of binary submodular functions ⋮ Unnamed Item ⋮ Minimizing a sum of submodular functions ⋮ Geometric Rescaling Algorithms for Submodular Function Minimization ⋮ Complexity and approximations for submodular minimization problems on two variables per inequality constraints ⋮ Finding Submodularity Hidden in Symmetric Difference ⋮ Inferring Relative Ability from Winning Probability in Multientrant Contests ⋮ Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties
This page was built for publication:
