On the public citation graph
Maximizing Symmetric Submodular Functions
0 signed · 45 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11600930_10openalex-snapshot
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions
inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1007/978-3-319-13075-0_42openalex-snapshot
Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization
inferredcites →https://doi.org/10.1007/978-3-642-22006-7_29openalex-snapshot
Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm
inferredcites →https://doi.org/10.1007/978-3-642-22006-7_30openalex-snapshot
Submodular Cost Allocation Problem and Applications
inferredcites →https://doi.org/10.1007/bf01585863openalex-snapshot
Minimizing symmetric submodular functions
inferredcites →https://doi.org/10.1007/s10107-004-0510-2openalex-snapshot
Greedy splitting algorithms for approximating multiway partition problems
inferredcites →https://doi.org/10.1016/0012-365x(79)90084-0openalex-snapshot
The tail of the hypergeometric distribution
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1109/focs.2011.34openalex-snapshot
Approximation Algorithms for Submodular Multiway Partition
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.1137/080733991openalex-snapshot
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
inferredcites →https://doi.org/10.1137/090750020openalex-snapshot
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
inferredcites →https://doi.org/10.1137/090779346openalex-snapshot
Maximizing Non-monotone Submodular Functions
inferredcites →https://doi.org/10.1137/110832318openalex-snapshot
Symmetry and Approximability of Submodular Maximization Problems
inferredcites →https://doi.org/10.1137/110839655openalex-snapshot
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
inferredcites →https://doi.org/10.1137/120891502openalex-snapshot
Algorithms for Symmetric Submodular Function Minimization under Hereditary Constraints and Generalizations
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/1386790.1386805openalex-snapshot
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
inferredcites →https://doi.org/10.1287/moor.1100.0463openalex-snapshot
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
inferredcites →https://doi.org/10.48550/arxiv.0912.0322openalex-snapshot
Submodular Functions: Extensions, Distributions, and Algorithms. A Survey
inferredcites →https://doi.org/10.48550/arxiv.1304.4948openalex-snapshot
On the Approximation of Submodular Functions
inferredcites →https://doi.org/10.48550/arxiv.1311.5939openalex-snapshot
Hypergeometric tail inequalities: ending the insanity
inferredcites →https://doi.org/10.48550/arxiv.1503.03905openalex-snapshot
Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems
inferredcites →https://doi.org/10.48550/arxiv.1508.02157openalex-snapshot
Deterministic Algorithms for Submodular Maximization Problems
inferredcites →https://doi.org/10.48550/arxiv.1611.03253openalex-snapshot
Constrained Submodular Maximization via a Non-symmetric Technique
inferredcites →https://doi.org/10.5555/1109557.1109675openalex-snapshot
An improved approximation algorithm for combinatorial auctions with submodular bidders
inferredcites →https://doi.org/10.5555/2133036.2133118openalex-snapshot
Multi-budgeted matchings and matroid intersection via dependent rounding
inferredcites →https://doi.org/10.5555/2627817.2627840openalex-snapshot
Local distribution and the symmetry gap: approximability of multiway partitioning problems
inferredcites →https://doi.org/10.5555/2884435.2884465openalex-snapshot
Improved approximation algorithms for k-submodular function maximization
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-3-030-24766-9_28openalex-snapshot
Guess Free Maximization of Submodular and Linear Sums
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.106010openalex-snapshot
A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115312openalex-snapshot
Efficient deterministic algorithms for maximizing symmetric submodular functions
inferred← citeshttps://doi.org/10.1109/icassp48485.2024.10448026openalex-snapshot
Finding Representative Sampling Subsets on Graphs via Submodularity
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.1201/9781351236423-42openalex-snapshot
Submodular Functions Maximization Problems
inferred← citeshttps://doi.org/10.1287/moor.2021.1224openalex-snapshot
An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint
inferred← citeshttps://doi.org/10.14445/22315373/ijmtt-v70i3p102openalex-snapshot
Quasi-Ultrafilter on the Connectivity System: Its Relationship to Branch-Decomposition
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.icalp.2020.6openalex-snapshot
Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints
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.1906.11237openalex-snapshot
Making a Sieve Random: Improved Semi-Streaming Algorithm for Submodular Maximization under a Cardinality Constraint
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.