Using atomic bounds to get sub-modular approximations

DOI10.1007/978-3-031-18843-5_5zbMATH Open1524.68372OpenAlexW4312978199MaRDI QIDQ6163907FDOQ6163907

Authors: S. Destercke, Agnès Rico, O. Strauss 

Publication date: 26 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-18843-5_5

Recommendations

• On additive approximate submodularity
• Approximate modularity revisited
• Approximate modularity revisited
• Submodular Approximation: Sampling-based Algorithms and Lower Bounds
• Submodular set functions and monotone systems in aggregation problems. II

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• Title not available (Why is that?)
• When upper probabilities are possibility measures
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• B-spline signal processing. I. Theory
• Set functions, games and capacities in decision making
• PROBABILITY INTERVALS: A TOOL FOR UNCERTAIN REASONING
• No empirical probability measure can converge in the total variation sense for all distributions
• On the granularity of summative kernels
• Practical representations of incomplete probabilistic knowledge
• Some axiomatic and algorithmic perspectives on the social ranking problem
• The legacy of 50 years of fuzzy sets: a discussion
• Binary interactions and subset choice
• Non-additive interval-valued F-transform
• Towards the unification of band-limited derivative operators for edge detection
• Interactive optimization of submodular functions under matroid constraints
• An efficient branch-and-cut algorithm for submodular function maximization

This page was built for publication: Using atomic bounds to get sub-modular approximations

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