A non-extendibility certificate for submodularity and applications

DOI10.1007/978-3-030-58150-3_49OpenAlexW3082433379MaRDI QIDQ2019511FDOQ2019511

Authors: Umang Bhaskar, Gunjan Kumar 

Publication date: 21 April 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-58150-3_49

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Lattice Theory: Foundation
• Self-testing/correcting with applications to numerical problems
• Title not available (Why is that?)
• Minimizing a Submodular Function on a Lattice
• Is submodularity testable?
• Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids
• Testing monotonicity
• Supermodular functions on finite lattices
• Combinatorial auctions with decreasing marginal utilities
• Equilibrium Points in Nonzero-Sum n-Person Submodular Games
• Computational limitations on learning from examples
• Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
• On the complexity of submodular function minimisation on diamonds
• On Proximity-Oblivious Testing

Cited In (2)

• The Complexity of Partial Function Extension for Coverage Functions
• Title not available (Why is that?)

This page was built for publication: A non-extendibility certificate for submodularity and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019511)