On the public citation graph

Approximation Algorithms for Submodular Data Summarization with a Knapsack Constraint

0 signed · 48 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.1007/978-3-030-24766-9_32openalex-snapshot
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint
inferredcites →https://doi.org/10.1007/978-3-642-17572-5_20openalex-snapshot
Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms
inferredcites →https://doi.org/10.1007/978-3-662-47672-7_26openalex-snapshot
Streaming Algorithms for Submodular Function Maximization
inferredcites →https://doi.org/10.1007/s00453-019-00628-yopenalex-snapshot
Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint
inferredcites →https://doi.org/10.1016/s0020-0190(99)00031-9openalex-snapshot
The budgeted maximum coverage problem
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/focs.2011.46openalex-snapshot
A Unified Continuous Greedy Algorithm for Submodular Maximization
inferredcites →https://doi.org/10.1109/focs.2016.34openalex-snapshot
Constrained Submodular Maximization: Beyond 1/e
inferredcites →https://doi.org/10.1109/icde.2017.137openalex-snapshot
Boosting Information Spread: An Algorithmic Approach
inferredcites →https://doi.org/10.1109/icnp.2019.8888148openalex-snapshot
Placement and Allocation of Virtual Network Functions: Multi-dimensional Case
inferredcites →https://doi.org/10.1109/infocom.2019.8737400openalex-snapshot
Joint Placement and Allocation of Virtual Network Functions with Budget and Capacity Constraints
inferredcites →https://doi.org/10.1137/090779346openalex-snapshot
Maximizing Non-monotone Submodular Functions
inferredcites →https://doi.org/10.1137/1.9781611973082.83openalex-snapshot
Submodular Maximization by Simulated Annealing
inferredcites →https://doi.org/10.1137/1.9781611973402.106openalex-snapshot
Submodular Maximization with Cardinality Constraints
inferredcites →https://doi.org/10.1137/1.9781611973402.110openalex-snapshot
Fast algorithms for maximizing submodular functions
inferredcites →https://doi.org/10.1137/1.9781611975482.16openalex-snapshot
Deterministic (½ + ε )-Approximation for Submodular Maximization over a Matroid
inferredcites →https://doi.org/10.1137/130929205openalex-snapshot
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
inferredcites →https://doi.org/10.1145/1281192.1281239openalex-snapshot
Cost-effective outbreak detection in networks
inferredcites →https://doi.org/10.1145/1536414.1536459openalex-snapshot
Non-monotone submodular maximization under matroid and knapsack constraints
inferredcites →https://doi.org/10.1145/1557019.1557047openalex-snapshot
Efficient influence maximization in social networks
inferredcites →https://doi.org/10.1145/2396761.2396857openalex-snapshot
Temporal corpus summarization using submodular word coverage
inferredcites →https://doi.org/10.1145/2623330.2623637openalex-snapshot
Streaming submodular maximization
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/3184990openalex-snapshot
Deterministic Algorithms for Submodular Maximization Problems
inferredcites →https://doi.org/10.1287/moor.2013.0592openalex-snapshot
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
inferredcites →https://doi.org/10.1287/moor.2018.0955openalex-snapshot
Constrained Submodular Maximization via a Nonsymmetric Technique
inferredcites →https://doi.org/10.1287/moor.7.3.410openalex-snapshot
Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
inferredcites →https://doi.org/10.1609/aaai.v30i1.10207openalex-snapshot
Noisy Submodular Maximization via Adaptive Sampling with Applications to Crowdsourced Image Collection Summarization
inferredcites →https://doi.org/10.1609/aaai.v32i1.11529openalex-snapshot
Streaming Non-Monotone Submodular Maximization: Personalized Video Summarization on the Fly
inferredcites →https://doi.org/10.1609/aaai.v33i01.33015861openalex-snapshot
Submodular Optimization over Streams with Inhomogeneous Decays
inferredcites →https://doi.org/10.4230/lipics.icalp.2019.53openalex-snapshot
A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s10878-024-01232-9openalex-snapshot
Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity
inferred← citeshttps://doi.org/10.1007/s11590-025-02194-5openalex-snapshot
Practical algorithm for minimum cost submodular cover problem with performance guarantees
inferred← citeshttps://doi.org/10.1016/j.artint.2025.104348openalex-snapshot
Efficient and effective budget-feasible mechanisms for submodular valuations
inferred← citeshttps://doi.org/10.1016/j.orl.2025.107295openalex-snapshot
A note on fast deterministic algorithms for non-monotone submodular maximization under a knapsack constraint
inferred← citeshttps://doi.org/10.1109/dsit55514.2022.9943820openalex-snapshot
An Algorithmic View of Streaming Submodular Data Summarization with A Knapsack Constraint
inferred← citeshttps://doi.org/10.1109/hpcc-dss-smartcity-dependsys60770.2023.00072openalex-snapshot
Deletion-Robust Submodular Maximization under a Knapsack Constraint
inferred← citeshttps://doi.org/10.1109/inista55318.2022.9894252openalex-snapshot
Fast Algorithm for Big Data Summarization with Knapsack and Partition Matroid Constraints
inferred← citeshttps://doi.org/10.1145/3543507.3583477openalex-snapshot
Randomized Pricing with Deferred Acceptance for Revenue Maximization with Submodular Objectives
inferred← citeshttps://doi.org/10.1145/3570615openalex-snapshot
Streaming Algorithms for Constrained Submodular Maximization
inferred← citeshttps://doi.org/10.1145/3578338.3593573openalex-snapshot
Streaming Algorithms for Constrained Submodular Maximization
inferred← citeshttps://doi.org/10.1145/3606376.3593573openalex-snapshot
Streaming Algorithms for Constrained Submodular Maximization
inferred← citeshttps://doi.org/10.14778/3551793.3551846openalex-snapshot
BABOONS
inferred← citeshttps://doi.org/10.1609/aaai.v37i6.25885openalex-snapshot
Practical Parallel Algorithms for Submodular Maximization Subject to a Knapsack Constraint with Nearly Optimal Adaptivity
inferred← citeshttps://doi.org/10.1609/aaai.v38i10.29053openalex-snapshot
Deletion-Robust Submodular Maximization with Knapsack Constraints
inferred← citeshttps://doi.org/10.1613/jair.1.16801openalex-snapshot
Practical Parallel Algorithms for Non-Monotone Submodular Maximization
inferred← citeshttps://doi.org/10.24963/ijcai.2023/459openalex-snapshot
Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint
inferred← citeshttps://doi.org/10.3389/fcpxs.2025.1544420openalex-snapshot
Diversity is key: fantasy football dream teams under budget constraints
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.