The Complexity of Partial Function Extension for Coverage Functions
From MaRDI portal
Publication:5875484
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 5968956 (Why is no real title available?)
- A non-extendibility certificate for submodularity and applications
- Combinatorial auctions with decreasing marginal utilities
- Computational limitations on learning from examples
- Convex functions on non-convex domains
- Error-free and best-fit extensions of partially defined Boolean functions
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Extension of convex function
- Geometric algorithms and combinatorial optimization.
- Is submodularity testable?
- Learning submodular functions
- Maximizing social influence in nearly optimal time
- Minimizing a Submodular Function on a Lattice
- Recognizing Coverage Functions
- Roofs and convexity
- Sketching valuation functions
- The complexity status of problems related to sparsest cuts
- The limitations of optimization from samples
- The smallest convex extensions of a convex function
Cited in
(2)
This page was built for publication: The Complexity of Partial Function Extension for Coverage Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875484)