Inequalities on submodular functions via term rewriting

DOI10.1016/j.ipl.2013.03.018zbMath1371.90141OpenAlexW2012609391MaRDI QIDQ2444736

Yuval Filmus

Publication date: 11 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.03.018

zbMATH Keywords

inequalitieslocal searchsubmodularityanalysis of algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Grammars and rewriting systems (68Q42)

Related Items (1)

Inferring range of information diffusion based on historical frequent items

Cites Work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Submodular functions and optimization.
• Matroid matching
• Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
• Maximizing Non-monotone Submodular Functions
• A threshold of ln n for approximating set cover
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• An analysis of approximations for maximizing submodular set functions—I
• Symmetry and Approximability of Submodular Maximization Problems
• Comments on bases in dependence structures
• Induced Matroids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Inequalities on submodular functions via term rewriting