Fractionally subadditive maximization under an incremental knapsack constraint
From MaRDI portal
Publication:2085751
Cites work
- A general approach for incremental approximation and hierarchical clustering
- A note on maximizing a submodular set function subject to a knapsack constraint
- A threshold of ln n for approximating set cover
- Algorithmic results for potential‐based flows: Easy and hard cases
- An analysis of approximations for maximizing submodular set functions—I
- An improved approximation algorithm for combinatorial auctions with submodular bidders
- Combinatorial auctions with decreasing marginal utilities
- Computing knapsack solutions with cardinality robustness
- Coverage, matching, and beyond: new results on budgeted mechanism design
- General bounds for incremental maximization
- Incremental flow
- Incremental network design with maximum flows
- Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (extended abstract)
- Maximizing a monotone submodular function with a bounded curvature under a knapsack constraint
- On maximizing welfare when utility functions are subadditive
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
- Optimization with demand oracles
- Packing a knapsack of unknown capacity
- Randomized strategies for cardinality robustness in the knapsack problem
- Robust Matchings
- Robust independence systems
- Robust matchings and matroid intersections
- Robust monotone submodular function maximization
- Robust randomized matchings
- Stochastic on-line knapsack problems
- Structured Robust Submodular Maximization: Offline and Online Algorithms
- Submodular maximization with uncertain knapsack capacity
- The online knapsack problem with incremental capacity
Cited in
(2)
This page was built for publication: Fractionally subadditive maximization under an incremental knapsack constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2085751)
