On the public citation graph

Symmetry and Approximability of Submodular Maximization Problems

0 signed · 109 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.1006/jctb.2000.1989openalex-snapshot
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
inferredcites →https://doi.org/10.1007/bf01584082openalex-snapshot
Matroids and the greedy algorithm
inferredcites →https://doi.org/10.1007/bf01588971openalex-snapshot
An analysis of approximations for maximizing submodular set functions—I
inferredcites →https://doi.org/10.1007/bf02579435openalex-snapshot
An analysis of the greedy algorithm for the submodular set covering problem
inferredcites →https://doi.org/10.1007/bfb0121195openalex-snapshot
An analysis of approximations for maximizing submodular set functions—II
inferredcites →https://doi.org/10.1007/s00453-007-9105-7openalex-snapshot
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions
inferredcites →https://doi.org/10.1023/b:joco.0000038913.96607.c2openalex-snapshot
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee
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.1145/285055.285059openalex-snapshot
A threshold of ln n for approximating set cover
inferredcites →https://doi.org/10.1145/502090.502096openalex-snapshot
A combinatorial strongly polynomial algorithm for minimizing submodular functions
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.1287/moor.7.3.410openalex-snapshot
Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems

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-16194-1_3openalex-snapshot
An Overview of Submodular Optimization: Single- and Multi-Objectives
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-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-031-93112-3_6openalex-snapshot
Monotone Submodular Multiway Partition
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_42openalex-snapshot
Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization
inferred← citeshttps://doi.org/10.1007/978-3-319-28684-6_12openalex-snapshot
Submodular Function Maximization on the Bounded Integer Lattice
inferred← citeshttps://doi.org/10.1007/978-3-319-33461-5_26openalex-snapshot
Robust Monotone Submodular Function Maximization
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_26openalex-snapshot
Streaming Algorithms for Submodular Function Maximization
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_44openalex-snapshot
Maximizing Symmetric Submodular Functions
inferred← citeshttps://doi.org/10.1007/s00453-023-01183-3openalex-snapshot
On Maximizing Sums of Non-monotone Submodular and Linear Functions
inferred← citeshttps://doi.org/10.1007/s10107-016-1038-yopenalex-snapshot
Graph cuts with interacting edge weights: examples, approximations, and algorithms
inferred← citeshttps://doi.org/10.1007/s10107-018-1320-2openalex-snapshot
Robust monotone submodular function 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/s10479-022-04835-9openalex-snapshot
Online risk-averse submodular maximization
inferred← citeshttps://doi.org/10.1007/s10732-022-09494-4openalex-snapshot
A heuristic search based on diversity for solving combinatorial problems
inferred← citeshttps://doi.org/10.1007/s40305-019-00260-1openalex-snapshot
Approximation Algorithms for Vertex Happiness
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2022.108478openalex-snapshot
Parallelized maximization of nonmonotone one-sided σ -smooth function
inferred← citeshttps://doi.org/10.1016/j.dam.2017.06.020openalex-snapshot
Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
inferred← citeshttps://doi.org/10.1016/j.geb.2014.01.007openalex-snapshot
Limitations of randomized mechanisms for combinatorial auctions
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.11.005openalex-snapshot
An almost optimal approximation algorithm for monotone submodular multiple knapsack
inferred← citeshttps://doi.org/10.1016/j.knosys.2018.03.008openalex-snapshot
Dissimilarity-constrained node attribute coverage diversification for novelty-enhanced top-k search in large attributed networks
inferred← citeshttps://doi.org/10.1016/j.orl.2011.11.007openalex-snapshot
Sell or Hold: A simple two-stage stochastic combinatorial optimization problem
inferred← citeshttps://doi.org/10.1080/02331934.2023.2173968openalex-snapshot
Regularized nonmonotone submodular maximization
inferred← citeshttps://doi.org/10.1109/cvpr42600.2020.00468openalex-snapshot
Learning to Select Base Classes for Few-Shot Classification
inferred← citeshttps://doi.org/10.1109/focs.2011.34openalex-snapshot
Approximation Algorithms for Submodular Multiway Partition
inferred← citeshttps://doi.org/10.1109/focs.2012.73openalex-snapshot
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
inferred← citeshttps://doi.org/10.1109/focs.2016.74openalex-snapshot
A New Framework for Distributed Submodular Maximization
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00013openalex-snapshot
A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization
inferred← citeshttps://doi.org/10.1109/icassp.2017.7952792openalex-snapshot
Multiple wavelength sensing array design
inferred← citeshttps://doi.org/10.1109/tit.2018.2873795openalex-snapshot
Sensor Array Design Through Submodular Optimization
inferred← citeshttps://doi.org/10.1109/tnse.2020.2964882openalex-snapshot
Budgeted Coupon Advertisement Problem: Algorithm and Robust Analysis
inferred← citeshttps://doi.org/10.1109/tnse.2024.3397188openalex-snapshot
Maximizing Social Welfare Subject to Network Externalities: A Unifying Submodular Optimization Approach
inferred← citeshttps://doi.org/10.1137/1.9781611973105.23openalex-snapshot
Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems
inferred← citeshttps://doi.org/10.1137/1.9781611973730.76openalex-snapshot
Optimal approximation for submodular and supermodular optimization with bounded curvature
inferred← citeshttps://doi.org/10.1137/1.9781611973730.77openalex-snapshot
Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization
inferred← citeshttps://doi.org/10.1137/1.9781611973730.80openalex-snapshot
Online Submodular Maximization with Preemption
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch30openalex-snapshot
Improved Approximation Algorithms for k-Submodular Function Maximization
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch31openalex-snapshot
Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions
inferred← citeshttps://doi.org/10.1137/1.9781611976465.114openalex-snapshot
Streaming Submodular Matching Meets the Primal-Dual Method
inferred← citeshttps://doi.org/10.1137/110839655openalex-snapshot
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
inferred← citeshttps://doi.org/10.1137/20m1357317openalex-snapshot
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model
inferred← citeshttps://doi.org/10.1137/22m147685xopenalex-snapshot
A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection
inferred← citeshttps://doi.org/10.1145/2213977.2214076openalex-snapshot
From query complexity to computational complexity
inferred← citeshttps://doi.org/10.1145/2850419openalex-snapshot
Maximizing k -Submodular Functions and Beyond
inferred← citeshttps://doi.org/10.1145/3033274.3085136openalex-snapshot
Approximation Algorithms for Maximin Fair Division
inferred← citeshttps://doi.org/10.1145/3055399.3055406openalex-snapshot
The limitations of optimization from samples
inferred← citeshttps://doi.org/10.1145/3070685openalex-snapshot
Maximizing Symmetric Submodular Functions
inferred← citeshttps://doi.org/10.1145/3184990openalex-snapshot
Deterministic Algorithms for Submodular Maximization Problems
inferred← citeshttps://doi.org/10.1145/3309764openalex-snapshot
Online Submodular Maximization with Preemption
inferred← citeshttps://doi.org/10.1145/3313276.3316327openalex-snapshot
Unconstrained submodular maximization with constant adaptive complexity
inferred← citeshttps://doi.org/10.1145/3357713.3384311openalex-snapshot
A polynomial lower bound on adaptive complexity of submodular maximization
inferred← citeshttps://doi.org/10.1145/3381525openalex-snapshot
Approximation Algorithms for Maximin Fair Division
inferred← citeshttps://doi.org/10.1145/3511018openalex-snapshot
The Limitations of Optimization from Samples
inferred← citeshttps://doi.org/10.1145/3519935.3519951openalex-snapshot
On the complexity of dynamic submodular maximization
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.3718131openalex-snapshot
The Cost of Consistency: Submodular Maximization with Constant Recourse
inferred← citeshttps://doi.org/10.1145/3798129.3800918openalex-snapshot
A Poisson Process for Submodular Maximization
inferred← citeshttps://doi.org/10.1201/9781351236423-42openalex-snapshot
Submodular Functions Maximization Problems
inferred← citeshttps://doi.org/10.1287/ijoo.2019.0041openalex-snapshot
Multiobjective Maximization of Monotone Submodular Functions with Cardinality Constraint
inferred← citeshttps://doi.org/10.1287/mnsc.2015.2254openalex-snapshot
Maximizing Stochastic Monotone Submodular Functions
inferred← citeshttps://doi.org/10.1287/moor.2016.0809openalex-snapshot
Comparing Apples and Oranges: Query Trade-off in Submodular Maximization
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.1287/moor.2021.1224openalex-snapshot
An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint
inferred← citeshttps://doi.org/10.1287/moor.2023.0276openalex-snapshot
Streaming Submodular Maximization Under Matroid Constraints
inferred← citeshttps://doi.org/10.14288/1.0401971openalex-snapshot
Online contention resolution schemes for matchings and matroids
inferred← citeshttps://doi.org/10.1609/aaai.v35i11.17186openalex-snapshot
Online Non-Monotone DR-Submodular Maximization
inferred← citeshttps://doi.org/10.24963/ijcai.2020/297openalex-snapshot
Non-monotone DR-submodular Maximization over General Convex Sets
inferred← citeshttps://doi.org/10.24963/ijcai.2021/411openalex-snapshot
Online Risk-Averse Submodular Maximization
inferred← citeshttps://doi.org/10.32657/10356/72857openalex-snapshot
Seed selection for viral marketing in online social networks : from influence maximization to profit maximization
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2014.160openalex-snapshot
Constrained Monotone Function Maximization and the Supermodular Degree
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2023.23openalex-snapshot
Continuous Submodular Function Maximization
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.41openalex-snapshot
Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2020.64openalex-snapshot
Weakly Submodular Function Maximization Using Local Submodularity Ratio
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.113openalex-snapshot
Budget-Smoothed Analysis for Submodular Maximization
inferred← citeshttps://doi.org/10.48550/arxiv.1202.2789openalex-snapshot
The Computational Complexity of Truthfulness in Combinatorial Auctions
inferred← citeshttps://doi.org/10.48550/arxiv.1402.0240openalex-snapshot
Graph Cuts with Interacting Edge Costs - Examples, Approximations, and Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1409.5900openalex-snapshot
Maximizing Symmetric Submodular Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1505.05423openalex-snapshot
Submodular Function Maximization over Distributive and Integer Lattices
inferred← citeshttps://doi.org/10.48550/arxiv.1509.01618openalex-snapshot
Efficient Sampling for k-Determinantal Point Processes
inferred← citeshttps://doi.org/10.48550/arxiv.1601.03095openalex-snapshot
Submodular Optimization under Noise
inferred← citeshttps://doi.org/10.48550/arxiv.1603.06052openalex-snapshot
Fast DPP Sampling for Nyström with Application to Kernel Methods
inferred← citeshttps://doi.org/10.48550/arxiv.1608.05346openalex-snapshot
Diversified Top-k Similarity Search in Large Attributed Networks
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.1703.06053openalex-snapshot
Fast Non-Monotone Submodular Maximisation Subject to a Matroid Constraint
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.1711.01566openalex-snapshot
Stochastic Submodular Maximization: The Case of Coverage Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1802.06052openalex-snapshot
Online Continuous Submodular Maximization
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.1905.09595openalex-snapshot
Non-monotone DR-submodular Maximization: Approximation and Regret Guarantees
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.5555/2627817.2627904openalex-snapshot
Communication complexity of combinatorial auctions with submodular valuations
inferred← citeshttps://doi.org/10.5555/2722129.2722206openalex-snapshot
Comparing apples and oranges: query tradeoff in submodular maximization
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.