On the public citation graph

Constrained Submodular Maximization: Beyond 1/e

0 signed · 69 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/s0167-6377(03)00062-2openalex-snapshot
A note on maximizing a submodular set function subject to a knapsack constraint
inferredcites →https://doi.org/10.1109/cvpr.2011.5995589openalex-snapshot
Submodularity beyond submodular energies: Coupling edges in graph cuts
inferredcites →https://doi.org/10.1109/focs.2011.46openalex-snapshot
A Unified Continuous Greedy Algorithm for Submodular Maximization
inferredcites →https://doi.org/10.1109/focs.2012.73openalex-snapshot
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
inferredcites →https://doi.org/10.1137/080733991openalex-snapshot
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
inferredcites →https://doi.org/10.1137/1.9781611973402.106openalex-snapshot
Submodular Maximization with Cardinality Constraints
inferredcites →https://doi.org/10.1137/110839655openalex-snapshot
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
inferredcites →https://doi.org/10.1145/1374376.1374389openalex-snapshot
Optimal approximation for the submodular welfare problem in the value oracle model
inferredcites →https://doi.org/10.1145/1536414.1536459openalex-snapshot
Non-monotone submodular maximization under matroid and knapsack constraints
inferredcites →https://doi.org/10.1145/2688073.2688086openalex-snapshot
On Multiplicative Weight Updates for Concave and Submodular Function Maximization
inferredcites →https://doi.org/10.1145/956750.956769openalex-snapshot
Maximizing the spread of influence through a social network
inferredcites →https://doi.org/10.1287/moor.1100.0463openalex-snapshot
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
inferredcites →https://doi.org/10.1287/moor.3.3.177openalex-snapshot
Best Algorithms for Approximating the Maximum of a Submodular Set Function
inferredcites →https://doi.org/10.4086/toc.2012.v008a005openalex-snapshot

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_105-1openalex-snapshot
Efficient Relaxation and Rounding Techniques for Submodular Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_10openalex-snapshot
$$\ell _1$$-Sparsity approximation bounds for packing integer programs
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_28openalex-snapshot
Guess Free Maximization of Submodular and Linear Sums
inferred← citeshttps://doi.org/10.1007/978-3-030-36412-0_46openalex-snapshot
Sequence Submodular Maximization Meets Streaming
inferred← citeshttps://doi.org/10.1007/978-3-030-41672-0_10openalex-snapshot
A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-93176-6_19openalex-snapshot
Measured Continuous Greedy with Differential Privacy
inferred← citeshttps://doi.org/10.1007/978-3-031-18530-4_22openalex-snapshot
Unified Greedy Approximability Beyond Submodular Maximization
inferred← citeshttps://doi.org/10.1007/978-3-031-91357-0_18openalex-snapshot
DR-Submodular Maximization and Its Application
inferred← citeshttps://doi.org/10.1007/978-3-031-93112-3_18openalex-snapshot
Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
inferred← citeshttps://doi.org/10.1007/978-3-032-07860-5_3openalex-snapshot
Variational Problem in Algorithms Design for DR-Submodular Maximization
inferred← citeshttps://doi.org/10.1007/s10107-020-01570-6openalex-snapshot
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
inferred← citeshttps://doi.org/10.1007/s10878-020-00558-4openalex-snapshot
A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice
inferred← citeshttps://doi.org/10.1007/s10878-020-00662-5openalex-snapshot
Sequence submodular maximization meets streaming
inferred← citeshttps://doi.org/10.1007/s10878-022-00875-wopenalex-snapshot
Private non-monotone submodular maximization
inferred← citeshttps://doi.org/10.1007/s10898-025-01473-wopenalex-snapshot
Revisiting non-monotone regularized submodular maximization: bi-criteria and PASS approximations
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115312openalex-snapshot
Efficient deterministic algorithms for maximizing symmetric submodular functions
inferred← citeshttps://doi.org/10.1017/s0960129521000372openalex-snapshot
Two-stage submodular maximization problem beyond nonnegative and monotone
inferred← citeshttps://doi.org/10.1109/hpcc-dss-smartcity-dependsys53884.2021.00085openalex-snapshot
A Dynamic Algorithm for Submodular Maximization with a Knapsack Constraint
inferred← citeshttps://doi.org/10.1109/ict.2018.8464913openalex-snapshot
Partition of Random Items: Tradeoff between Binning Utility and Meta Information Leakage
inferred← citeshttps://doi.org/10.1109/ipdps47924.2020.00099openalex-snapshot
Packet-in Request Redirection for Minimizing Control Plane Response Time
inferred← citeshttps://doi.org/10.1137/1.9781611976465.114openalex-snapshot
Streaming Submodular Matching Meets the Primal-Dual Method
inferred← citeshttps://doi.org/10.1137/1.9781611976465.63openalex-snapshot
Beyond Submodular Maximization via One-Sided Smoothness
inferred← citeshttps://doi.org/10.1137/18m1172314openalex-snapshot
The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods
inferred← citeshttps://doi.org/10.1137/24m1698122openalex-snapshot
Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint
inferred← citeshttps://doi.org/10.1145/3034786.3034792openalex-snapshot
Efficient and Provable Multi-Query Optimization
inferred← citeshttps://doi.org/10.1145/3070685openalex-snapshot
Maximizing Symmetric Submodular Functions
inferred← citeshttps://doi.org/10.1145/3313276.3316406openalex-snapshot
Parallelizing greedy for submodular set function maximization in matroids and beyond
inferred← citeshttps://doi.org/10.1145/3410220.3453922openalex-snapshot
Approximation Algorithms for Submodular Data Summarization with a Knapsack Constraint
inferred← citeshttps://doi.org/10.1145/3447383openalex-snapshot
Approximation Algorithms for Submodular Data Summarization with a Knapsack Constraint
inferred← citeshttps://doi.org/10.1145/3618260.3649630openalex-snapshot
Constrained Submodular Maximization via New Bounds for DR-Submodular Functions
inferred← citeshttps://doi.org/10.1145/3717823.3718120openalex-snapshot
Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
inferred← citeshttps://doi.org/10.1145/3798129.3800918openalex-snapshot
A Poisson Process for Submodular Maximization
inferred← citeshttps://doi.org/10.1287/ijoc.2020.0998openalex-snapshot
Structured Robust Submodular Maximization: Offline and Online Algorithms
inferred← citeshttps://doi.org/10.1287/moor.2018.0955openalex-snapshot
Constrained Submodular Maximization via a Nonsymmetric Technique
inferred← citeshttps://doi.org/10.1287/moor.2018.0965openalex-snapshot
Submodular Maximization Through the Lens of Linear Programming
inferred← citeshttps://doi.org/10.1287/moor.2021.1172openalex-snapshot
The Power of Subsampling in Submodular Maximization
inferred← citeshttps://doi.org/10.14778/3467861.3467866openalex-snapshot
Unconstrained submodular maximization with modular costs
inferred← citeshttps://doi.org/10.1609/aaai.v35i8.16860openalex-snapshot
Differentially Private Decomposable Submodular Maximization
inferred← citeshttps://doi.org/10.17760/d20652998openalex-snapshot
Higher utility methods for differentially private optimization
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.5234openalex-snapshot
Study of Fundamental Tradeoff Between Deliverable and Private Information in Statistical Inference
inferred← citeshttps://doi.org/10.4230/lipics.esa.2023.98openalex-snapshot
Simple Deterministic Approximation for Submodular Multiple Knapsack Problem
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.6openalex-snapshot
Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2020.64openalex-snapshot
Weakly Submodular Function Maximization Using Local Submodularity Ratio
inferred← citeshttps://doi.org/10.48550/arxiv.1611.03253openalex-snapshot
Constrained Submodular Maximization via a Non-symmetric Technique
inferred← citeshttps://doi.org/10.48550/arxiv.1612.05222openalex-snapshot
Multivariate Submodular Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1704.01652openalex-snapshot
Greed is Good: Near-Optimal Submodular Maximization via Greedy Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1707.04347openalex-snapshot
Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?
inferred← citeshttps://doi.org/10.48550/arxiv.1711.01566openalex-snapshot
Stochastic Submodular Maximization: The Case of Coverage Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1711.02515openalex-snapshot
Continuous DR-submodular Maximization: Structure and Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1711.02724openalex-snapshot
Algorithms to Approximate Column-Sparse Packing Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1901.09209openalex-snapshot
Approximate Submodularity and Its Implications in Discrete Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1904.09354openalex-snapshot
Submodular Maximization Beyond Non-negativity: Guarantees, Fast Algorithms, and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1906.11237openalex-snapshot
Making a Sieve Random: Improved Semi-Streaming Algorithm for Submodular Maximization under a Cardinality Constraint
inferred← citeshttps://doi.org/10.48550/arxiv.1907.00312openalex-snapshot
Competitive Algorithms for Online Budget-Constrained Continuous DR-Submodular Problems
inferred← citeshttps://doi.org/10.48550/arxiv.2107.07103openalex-snapshot
On Optimal Approximations for $k$-Submodular Maximization via Multilinear Extension
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.