On the public citation graph

Comparing Apples and Oranges: Query Trade-off in Submodular Maximization

0 signed · 70 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-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf01588971openalex-snapshot
An analysis of approximations for maximizing submodular set functions—I
inferredcites →https://doi.org/10.1007/bf02523688openalex-snapshot
Improved approximation algorithms for MAXk-CUT and MAX BISECTION
inferredcites →https://doi.org/10.1016/j.ipl.2006.06.003openalex-snapshot
An efficient approximation for the Generalized Assignment Problem
inferredcites →https://doi.org/10.1016/s0020-0190(99)00031-9openalex-snapshot
The budgeted maximum coverage problem
inferredcites →https://doi.org/10.1016/s0166-218x(99)00103-1openalex-snapshot
An 0.828-approximation algorithm for the uncapacitated facility location problem
inferredcites →https://doi.org/10.1016/s0167-5060(08)70732-5openalex-snapshot
On the Uncapacitated Location Problem
inferredcites →https://doi.org/10.1017/s000497270004140xopenalex-snapshot
Comments on bases in dependence structures
inferredcites →https://doi.org/10.1061/(asce)0733-9496(2008)134:6(516)openalex-snapshot
Efficient Sensor Placement Optimization for Securing Large Water Distribution Networks
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.2006.14openalex-snapshot
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
inferredcites →https://doi.org/10.1109/focs.2010.60openalex-snapshot
Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures
inferredcites →https://doi.org/10.1109/focs.2011.46openalex-snapshot
A Unified Continuous Greedy Algorithm for Submodular Maximization
inferredcites →https://doi.org/10.1109/iccv.2001.937505openalex-snapshot
Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images
inferredcites →https://doi.org/10.1109/istcs.1995.377033openalex-snapshot
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
inferredcites →https://doi.org/10.1137/080733991openalex-snapshot
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
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.9781611973105.21openalex-snapshot
Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection
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/110832318openalex-snapshot
Symmetry and Approximability of Submodular Maximization Problems
inferredcites →https://doi.org/10.1137/s0097539700382820openalex-snapshot
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
inferredcites →https://doi.org/10.1137/s0097539705447372openalex-snapshot
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
inferredcites →https://doi.org/10.1137/s0097539797328847openalex-snapshot
Gadgets, Approximation, and Linear Programming
inferredcites →https://doi.org/10.1142/9789814282673_0001openalex-snapshot
Analyzing Randomized Search Heuristics: Tools from Probability Theory
inferredcites →https://doi.org/10.1145/1109557.1109624openalex-snapshot
Tight approximation algorithms for maximum general assignment problems
inferredcites →https://doi.org/10.1145/1367497.1367524openalex-snapshot
Optimal marketing strategies over social networks
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.1145/285055.285059openalex-snapshot
A threshold of ln n for approximating set cover
inferredcites →https://doi.org/10.1145/956750.956769openalex-snapshot
Maximizing the spread of influence through a social network
inferredcites →https://doi.org/10.1287/mnsc.23.8.789openalex-snapshot
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
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.1561/2200000039openalex-snapshot
Learning with Submodular Functions: A Convex Optimization Perspective

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_89-1openalex-snapshot
Practical Submodular Maximization: A Primer
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_8openalex-snapshot
Online Submodular Maximization: Beating 1/2 Made Simple
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-031-43421-1_19openalex-snapshot
A Scalable Solution for the Extended Multi-channel Facility Location Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-73365-9_7openalex-snapshot
A Fast Algorithm for Submodular Maximization with a Matroid Constraint
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/s10107-019-01459-zopenalex-snapshot
Online submodular maximization: beating 1/2 made simple
inferred← citeshttps://doi.org/10.1007/s10489-021-02276-8openalex-snapshot
Maximizing a deep submodular function optimization with a weighted MAX-SAT problem for trajectory clustering and motion segmentation
inferred← citeshttps://doi.org/10.1007/s10898-024-01371-7openalex-snapshot
Fast deterministic algorithms for non-submodular maximization with strong performance guarantees
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.ifacol.2020.12.1908openalex-snapshot
Threshold Bundle-based Task Allocation for Multiple Aerial Robots
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.007openalex-snapshot
Beyond pointwise submodularity: Non-monotone adaptive submodular maximization in linear time
inferred← citeshttps://doi.org/10.1080/02331934.2023.2173968openalex-snapshot
Regularized nonmonotone submodular maximization
inferred← citeshttps://doi.org/10.1080/24725854.2019.1584832openalex-snapshot
A budgeted maximum multiple coverage model for cybersecurity planning and management
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00050openalex-snapshot
Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint
inferred← citeshttps://doi.org/10.1109/icuas.2019.8798293openalex-snapshot
Efficient Decentralized Task Allocation for UAV Swarms in Multi-target Surveillance Missions
inferred← citeshttps://doi.org/10.1109/tro.2025.3613566openalex-snapshot
Efficient Decentralized Parallel Task Allocation for Multiple Robots
inferred← citeshttps://doi.org/10.1137/1.9781611975482.16openalex-snapshot
Deterministic (½ + ε )-Approximation for Submodular Maximization over a Matroid
inferred← citeshttps://doi.org/10.1137/19m125515xopenalex-snapshot
Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid
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/3313276.3316406openalex-snapshot
Parallelizing greedy for submodular set function maximization in matroids and beyond
inferred← citeshttps://doi.org/10.1145/3519935.3519951openalex-snapshot
On the complexity of dynamic submodular maximization
inferred← citeshttps://doi.org/10.1145/3769079openalex-snapshot
From Global to Query-Dependent: Summarization of Large Hierarchical DAGs
inferred← citeshttps://doi.org/10.1145/3798129.3800918openalex-snapshot
A Poisson Process for Submodular Maximization
inferred← citeshttps://doi.org/10.1186/s40537-021-00416-yopenalex-snapshot
A sample decreasing threshold greedy-based algorithm for big data summarisation
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.2021.1172openalex-snapshot
The Power of Subsampling in Submodular Maximization
inferred← citeshttps://doi.org/10.14778/3705829.3705833openalex-snapshot
Efficient and Effective Algorithms for A Family of Influence Maximization Problems with A Matroid Constraint
inferred← citeshttps://doi.org/10.14778/3836663.3836679openalex-snapshot
Fast and Private Max-Sum Diversification
inferred← citeshttps://doi.org/10.1613/jair.1.15484openalex-snapshot
Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models
inferred← citeshttps://doi.org/10.48550/arxiv.1811.07673openalex-snapshot
Fast submodular maximization subject to k-extendible system constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1905.00948openalex-snapshot
Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1908.06242openalex-snapshot
Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint
inferred← citeshttps://doi.org/10.48550/arxiv.2009.13998openalex-snapshot
How Do You Want Your Greedy: Simultaneous or Repeated?
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.