On the public citation graph
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
0 signed · 216 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.1002/9780470057339.vam008openalex-snapshot
Maximum Entropy Sampling
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/978-3-540-74208-1_20openalex-snapshot
Encouraging Cooperation in Sharing Supermodular Costs
inferredcites →https://doi.org/10.1007/978-3-642-68874-4_10openalex-snapshot
Submodular functions and convexity
inferredcites →https://doi.org/10.1007/bf01588971openalex-snapshot
An analysis of approximations for maximizing submodular set functions—I
inferredcites →https://doi.org/10.1007/bfb0024483openalex-snapshot
Non-oblivious local search for MAX 2-CCSP with application to MAX DICUT
inferredcites →https://doi.org/10.1007/bfb0121195openalex-snapshot
An analysis of approximations for maximizing submodular set functions—II
inferredcites →https://doi.org/10.1007/s00037-006-0205-6openalex-snapshot
On the complexity of approximating k-set packing
inferredcites →https://doi.org/10.1007/s10107-006-0024-1openalex-snapshot
Solving maximum-entropy sampling problems using factored masks
inferredcites →https://doi.org/10.1007/s101070050055openalex-snapshot
Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems
inferredcites →https://doi.org/10.1016/0166-218x(83)90040-9openalex-snapshot
Canonical decompositions of symmetric submodular systems
inferredcites →https://doi.org/10.1016/0377-2217(95)00205-7openalex-snapshot
Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
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.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.1023/b:joco.0000038913.96607.c2openalex-snapshot
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee
inferredcites →https://doi.org/10.1093/qmath/27.3.339openalex-snapshot
MATROIDS AND SUBMODULAR FUNCTIONS
inferredcites →https://doi.org/10.1109/focs.2007.40openalex-snapshot
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling
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/0910022openalex-snapshot
An Accelerated Sequential Algorithm for Producing D -Optimal Designs
inferredcites →https://doi.org/10.1137/1.9781611973068.59openalex-snapshot
Approximating Submodular Functions Everywhere
inferredcites →https://doi.org/10.1137/s089548010036813xopenalex-snapshot
A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts
inferredcites →https://doi.org/10.1142/9789812796936_others05openalex-snapshot
Combinatorial Optimization
inferredcites →https://doi.org/10.1145/1276958.1277149openalex-snapshot
Evolutionary algorithms and matroid optimization problems
inferredcites →https://doi.org/10.1145/1367497.1367524openalex-snapshot
Optimal marketing strategies over social networks
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/1386790.1386805openalex-snapshot
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
inferredcites →https://doi.org/10.1145/1536414.1536459openalex-snapshot
Non-monotone submodular maximization under matroid and knapsack constraints
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/335305.335317openalex-snapshot
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
inferredcites →https://doi.org/10.1145/502090.502096openalex-snapshot
A combinatorial strongly polynomial algorithm for minimizing submodular functions
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/mnsc.45.11.1539openalex-snapshot
The Data-Correcting Algorithm for the Minimization of Supermodular 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/opre.43.4.684openalex-snapshot
An Exact Algorithm for Maximum Entropy Sampling
inferredcites →https://doi.org/10.1287/opre.46.5.655openalex-snapshot
Constrained Maximum-Entropy Sampling
inferredcites →https://doi.org/10.48550/arxiv.0805.1071openalex-snapshot
Submodular approximation: sampling-based algorithms and lower bounds
inferredcites →https://doi.org/10.5555/1496770.1496830openalex-snapshot
Maximizing submodular set functions subject to multiple linear constraints
inferredcites →https://doi.org/10.5555/313651.313669openalex-snapshot
A combinatorial algorithm for minimizing symmetric submodular functions
inferredcites →https://doi.org/10.5555/365411.365412openalex-snapshot
Combinatorial approximation algorithms for the maximum directed cut problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.6575openalex-snapshot
Stochastic greedy algorithms for maximizing constrained submodular + supermodular functions
inferred← citeshttps://doi.org/10.1002/net.21619openalex-snapshot
Optimal response to epidemics and cyber attacks in networks
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_23openalex-snapshot
Approximate Multi-matroid Intersection via Iterative Refinement
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-59267-7_13openalex-snapshot
Two-Stage Submodular Maximization Problem Beyond Non-negative and Monotone
inferred← citeshttps://doi.org/10.1007/978-3-030-66046-8_37openalex-snapshot
Nonsubmodular Constrained Profit Maximization from Increment Perspective
inferred← citeshttps://doi.org/10.1007/978-3-030-80879-2_5openalex-snapshot
Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique
inferred← citeshttps://doi.org/10.1007/978-3-030-92681-6_17openalex-snapshot
Two-Stage Stochastic Max-Weight Independent Set Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-92681-6_3openalex-snapshot
Two-Stage Submodular Maximization Under Curvature
inferred← citeshttps://doi.org/10.1007/978-3-031-20350-3_13openalex-snapshot
Two-Stage Submodular Maximization Under Knapsack and Matroid Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-20350-3_22openalex-snapshot
Two-Stage Non-submodular Maximization
inferred← citeshttps://doi.org/10.1007/978-3-031-22105-7_40openalex-snapshot
Two-Stage BP Maximization Under p-matroid Constraint
inferred← citeshttps://doi.org/10.1007/978-3-031-22105-7_44openalex-snapshot
Improved Deterministic Algorithms for Non-monotone Submodular Maximization
inferred← citeshttps://doi.org/10.1007/978-3-032-06706-7_7openalex-snapshot
Incremental–Decremental Maximization
inferred← citeshttps://doi.org/10.1007/978-3-319-00200-2_10openalex-snapshot
Techniques for Submodular Maximization
inferred← citeshttps://doi.org/10.1007/978-3-319-33461-5_5openalex-snapshot
Max-Cut Under Graph Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-71924-5_1openalex-snapshot
On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_4openalex-snapshot
Submodular Secretary Problem and Extensions
inferred← citeshttps://doi.org/10.1007/978-3-642-17572-5_20openalex-snapshot
Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_29openalex-snapshot
Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_19openalex-snapshot
Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_1openalex-snapshot
Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-30642-6_7openalex-snapshot
Approximating Minimum Power Edge-Multi-Covers
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_4openalex-snapshot
Efficient Submodular Function Maximization under Linear Packing Constraints
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/978-981-19-9006-9_3openalex-snapshot
Data Transmission Empowered by Edge Computing
inferred← citeshttps://doi.org/10.1007/978-981-19-9006-9_6openalex-snapshot
Airborne Sensing Application: Reusing Delivery Drones
inferred← citeshttps://doi.org/10.1007/s10107-017-1154-3openalex-snapshot
Approximating graph-constrained max-cut
inferred← citeshttps://doi.org/10.1007/s10107-020-01524-yopenalex-snapshot
Approximate multi-matroid intersection via iterative refinement
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/s10107-020-01607-wopenalex-snapshot
Submodular function minimization and polarity
inferred← citeshttps://doi.org/10.1007/s10107-020-01614-xopenalex-snapshot
Electrical flows over spanning trees
inferred← citeshttps://doi.org/10.1007/s10878-013-9652-6openalex-snapshot
Approximating minimum power edge-multi-covers
inferred← citeshttps://doi.org/10.1007/s10878-020-00662-5openalex-snapshot
Sequence submodular maximization meets streaming
inferred← citeshttps://doi.org/10.1007/s10878-020-00672-3openalex-snapshot
Non-monotone submodular function maximization under k-system constraint
inferred← citeshttps://doi.org/10.1007/s10878-021-00774-6openalex-snapshot
Nonsubmodular constrained profit maximization from increment perspective
inferred← citeshttps://doi.org/10.1007/s10878-023-01001-0openalex-snapshot
Two-stage submodular maximization under curvature
inferred← citeshttps://doi.org/10.1007/s10878-023-01021-wopenalex-snapshot
On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints
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/s10878-025-01374-4openalex-snapshot
Fast approximation algorithm for non-monotone DR-submodular maximization under size constraint
inferred← citeshttps://doi.org/10.1007/s10898-021-01063-6openalex-snapshot
Maximization problems of balancing submodular relevance and supermodular diversity
inferred← citeshttps://doi.org/10.1007/s10957-022-02145-5openalex-snapshot
Greedy Guarantees for Non-submodular Function Maximization Under Independent System Constraint with Applications
inferred← citeshttps://doi.org/10.1007/s11280-022-01047-wopenalex-snapshot
CoTask: Correlation-aware task offloading in edge computing
inferred← citeshttps://doi.org/10.1007/s11590-019-01430-zopenalex-snapshot
Streaming algorithm for maximizing a monotone non-submodular function under d-knapsack constraint
inferred← citeshttps://doi.org/10.1007/s11704-024-40266-4openalex-snapshot
Deterministic streaming algorithms for non-monotone submodular maximization
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103597openalex-snapshot
Pareto Optimization for Subset Selection with Dynamic Cost Constraints
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.07.003openalex-snapshot
Supermodular covering knapsack polytope
inferred← citeshttps://doi.org/10.1016/j.disopt.2017.01.003openalex-snapshot
On maximizing a monotone k -submodular function subject to a matroid constraint
inferred← citeshttps://doi.org/10.1016/j.ins.2024.120259openalex-snapshot
Distributed neural tensor completion for network monitoring data recovery
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.03.018openalex-snapshot
Inequalities on submodular functions via term rewriting
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.jcss.2021.11.005openalex-snapshot
An almost optimal approximation algorithm for monotone submodular multiple knapsack
inferred← citeshttps://doi.org/10.1016/j.orl.2011.10.002openalex-snapshot
Maximizing non-monotone submodular set functions subject to different constraints: Combined algorithms
inferred← citeshttps://doi.org/10.1016/j.orl.2018.11.002openalex-snapshot
Constrained submodular maximization via greedy local search
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.1016/j.orl.2026.107507openalex-snapshot
A constant approximation algorithm for fair submodular maximization under a knapsack constraint
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.11.009openalex-snapshot
Approximability issues for unconstrained and constrained maximization of half-product related functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.09.029openalex-snapshot
The submodularity of two-stage stochastic maximum-weight independent set problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114017openalex-snapshot
Two-stage non-submodular maximization
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114293openalex-snapshot
Improved deterministic algorithms for non-monotone submodular maximization
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114469openalex-snapshot
Two-stage BP maximization under p-matroid constraint
inferred← citeshttps://doi.org/10.1017/s0960129521000372openalex-snapshot
Two-stage submodular maximization problem beyond nonnegative and monotone
inferred← citeshttps://doi.org/10.1109/csss.2011.5972082openalex-snapshot
Submodular-function maximization subject to multiple constraints
inferred← citeshttps://doi.org/10.1109/cvpr.2015.7298836openalex-snapshot
Gaze-enabled egocentric video summarization via constrained submodular maximization
inferred← citeshttps://doi.org/10.1109/focs.2010.60openalex-snapshot
Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures
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.2015.37openalex-snapshot
The Submodular Secretary Problem Goes Linear
inferred← citeshttps://doi.org/10.1109/focs.2018.00080openalex-snapshot
Random Order Contention Resolution Schemes
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/icc.2015.7248844openalex-snapshot
Joint caching and base station activation for green heterogeneous cellular networks
inferred← citeshttps://doi.org/10.1109/iccps.2016.7479120openalex-snapshot
Towards Scalable Voltage Control in Smart Grid: A Submodular Optimization Approach
inferred← citeshttps://doi.org/10.1109/ijcnn64981.2025.11227187openalex-snapshot
Deep Non-monotone Submodular Network: An Application to Conditional Video Summarization
inferred← citeshttps://doi.org/10.1109/infocom53939.2023.10229060openalex-snapshot
Joint Edge Aggregation and Association for Cost-Efficient Multi-Cell Federated Learning
inferred← citeshttps://doi.org/10.1109/lcsys.2026.3670932openalex-snapshot
A Priority-Ordered Swapping Algorithm for Submodular Maximization Problems
inferred← citeshttps://doi.org/10.1109/ojcoms.2023.3235274openalex-snapshot
Heterogeneous Doppler Spread-Based CSI Estimation Planning for TDD Massive MIMO
inferred← citeshttps://doi.org/10.1109/spawc.2017.8227678openalex-snapshot
Incentive mechanism design for cache-assisted D2D communications: A mobility-aware approach
inferred← citeshttps://doi.org/10.1109/ssp.2012.6319688openalex-snapshot
Theoretical guarantees on penalized information gathering
inferred← citeshttps://doi.org/10.1109/tits.2023.3326954openalex-snapshot
Online Matrix Factorization-Based Traffic Flow Prediction Empowered by Edge Computing for the CAVs
inferred← citeshttps://doi.org/10.1109/tits.2024.3435969openalex-snapshot
Cost-Efficient Edge Federated Learning Over Multiple Base Stations for the ITS Based on Connected and Autonomous Vehicles
inferred← citeshttps://doi.org/10.1109/tkde.2017.2787757openalex-snapshot
Profit Maximization for Viral Marketing in Online Social Networks: Algorithms and Analysis
inferred← citeshttps://doi.org/10.1109/tkde.2026.3657421openalex-snapshot
Efficient Algorithms for Budgeted Profit Maximization With Theoretical Guarantees
inferred← citeshttps://doi.org/10.1109/tmc.2020.3043000openalex-snapshot
Robust Offloading Scheduling for Mobile Edge Computing
inferred← citeshttps://doi.org/10.1109/tmc.2021.3127212openalex-snapshot
Reusing Delivery Drones for Urban Crowdsensing
inferred← citeshttps://doi.org/10.1109/tnet.2024.3423316openalex-snapshot
Cost-Efficient Federated Learning for Edge Intelligence in Multi-Cell Networks
inferred← citeshttps://doi.org/10.1109/tnnls.2018.2885591openalex-snapshot
Submodular Function Optimization for Motion Clustering and Image Segmentation
inferred← citeshttps://doi.org/10.1109/tnse.2020.2984658openalex-snapshot
Edge Computing-Empowered Large-Scale Traffic Data Recovery Leveraging Low-Rank Theory
inferred← citeshttps://doi.org/10.1109/tpwrs.2017.2691320openalex-snapshot
Submodular Optimization for Voltage Control
inferred← citeshttps://doi.org/10.1109/twc.2016.2613517openalex-snapshot
Low-Complexity Beam Allocation for Switched-Beam Based Multiuser Massive MIMO Systems
inferred← citeshttps://doi.org/10.1109/twc.2018.2858261openalex-snapshot
SAS-Assisted Coexistence-Aware Dynamic Channel Assignment in CBRS Band
inferred← citeshttps://doi.org/10.1109/wiopt.2015.7151103openalex-snapshot
Scalable and distributed submodular maximization with matroid constraints
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.9781611975482.16openalex-snapshot
Deterministic (½ + ε )-Approximation for Submodular Maximization over a Matroid
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/120888909openalex-snapshot
Submodular Functions: Learnability, Structure, and Optimization
inferred← citeshttps://doi.org/10.1137/130929205openalex-snapshot
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
inferred← citeshttps://doi.org/10.1137/16m1105220openalex-snapshot
The Submodular Secretary Problem Goes Linear
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.1142/9789814324359_0173openalex-snapshot
Submodular Functions: Optimization and Approximation
inferred← citeshttps://doi.org/10.1142/s0129054125400040openalex-snapshot
Note on Two-Stage BP Maximization
inferred← citeshttps://doi.org/10.1145/1536414.1536459openalex-snapshot
Non-monotone submodular maximization under matroid and knapsack constraints
inferred← citeshttps://doi.org/10.1145/1810479.1810483openalex-snapshot
Scheduling to minimize power consumption using submodular functions
inferred← citeshttps://doi.org/10.1145/1993636.1993740openalex-snapshot
Submodular function maximization via the multilinear relaxation and contention resolution schemes
inferred← citeshttps://doi.org/10.1145/2688073.2688086openalex-snapshot
On Multiplicative Weight Updates for Concave and Submodular Function Maximization
inferred← citeshttps://doi.org/10.1145/2746226openalex-snapshot
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
inferred← citeshttps://doi.org/10.1145/3033274.3085136openalex-snapshot
Approximation Algorithms for Maximin Fair Division
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/3355400openalex-snapshot
Algorithms to Approximate Column-sparse Packing Problems
inferred← citeshttps://doi.org/10.1145/3381525openalex-snapshot
Approximation Algorithms for Maximin Fair Division
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/3595296openalex-snapshot
Enabling Cost-effective Wireless Data Collection by Piggybacking on Delivery Drones in Agriculture
inferred← citeshttps://doi.org/10.1145/3606376.3593573openalex-snapshot
Streaming Algorithms for Constrained 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/3637528.3671778openalex-snapshot
Fairness in Streaming Submodular Maximization Subject to a Knapsack Constraint
inferred← citeshttps://doi.org/10.1145/3637528.3671951openalex-snapshot
CURLS: Causal Rule Learning for Subgroups with Significant Treatment Effect
inferred← citeshttps://doi.org/10.1145/3638052openalex-snapshot
Addressing Heterogeneity in Federated Learning with Client Selection via Submodular Optimization
inferred← citeshttps://doi.org/10.1145/3691620.3694984openalex-snapshot
SLIM: a Scalable and Interpretable Light-weight Fault Localization Algorithm for Imbalanced Data in Microservice
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/educ.2023.0255openalex-snapshot
Mixed-Integer Programming Approaches to Generalized Submodular Optimization and Its Applications
inferred← citeshttps://doi.org/10.1287/mnsc.2015.2254openalex-snapshot
Maximizing Stochastic Monotone Submodular Functions
inferred← citeshttps://doi.org/10.1287/mnsc.2023.01726openalex-snapshot
Joint Placement, Delivery Promise and Fulfillment in Online Retail
inferred← citeshttps://doi.org/10.1287/moor.1100.0463openalex-snapshot
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
inferred← citeshttps://doi.org/10.1287/moor.2014.0668openalex-snapshot
Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints
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.2022.0320openalex-snapshot
On Constrained Mixed-Integer DR-Submodular Minimization
inferred← citeshttps://doi.org/10.1287/opre.2021.2188openalex-snapshot
Constrained Assortment Optimization Under the Paired Combinatorial Logit Model
inferred← citeshttps://doi.org/10.14288/1.0401971openalex-snapshot
Online contention resolution schemes for matchings and matroids
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.13472openalex-snapshot
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
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.24963/ijcai.2023/617openalex-snapshot
Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint
inferred← citeshttps://doi.org/10.26599/tst.2023.9010107openalex-snapshot
Two-Stage Submodular Maximization Under Knapsack Problem
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.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.48550/arxiv.0908.2788openalex-snapshot
Maximizing Stochastic Monotone Submodular Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1105.2048openalex-snapshot
Approximation Algorithms for Submodular Multiway Partition
inferred← citeshttps://doi.org/10.48550/arxiv.1105.4593openalex-snapshot
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
inferred← citeshttps://doi.org/10.48550/arxiv.1107.4893openalex-snapshot
Approximating minimum-power edge-multicovers
inferred← citeshttps://doi.org/10.48550/arxiv.1110.4860openalex-snapshot
Symmetry and approximability of submodular maximization problems
inferred← citeshttps://doi.org/10.48550/arxiv.1409.0080openalex-snapshot
Show Me the Money: Dynamic Recommendations for Revenue Maximization
inferred← citeshttps://doi.org/10.48550/arxiv.1409.5900openalex-snapshot
Maximizing Symmetric Submodular Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1507.08384openalex-snapshot
The Submodular Secretary Problem Goes Linear
inferred← citeshttps://doi.org/10.48550/arxiv.1607.07957openalex-snapshot
On maximizing a monotone k-submodular function subject to a matroid constraint
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.1704.06901openalex-snapshot
On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives
inferred← citeshttps://doi.org/10.48550/arxiv.1711.02724openalex-snapshot
Algorithms to Approximate Column-Sparse Packing Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1807.05532openalex-snapshot
Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid
inferred← citeshttps://doi.org/10.48550/arxiv.1902.03794openalex-snapshot
Exploiting Structure of Uncertainty for Efficient Matroid Semi-Bandits
inferred← citeshttps://doi.org/10.48550/arxiv.1906.04449openalex-snapshot
Almost Optimal Semi-streaming Maximization for k-Extendible Systems
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.2002.03503openalex-snapshot
Regularized Submodular Maximization at Scale
inferred← citeshttps://doi.org/10.48550/arxiv.2009.13998openalex-snapshot
How Do You Want Your Greedy: Simultaneous or Repeated?
inferred← citeshttps://doi.org/10.48550/arxiv.2106.07116openalex-snapshot
The Power of Randomization: Efficient and Effective Algorithms for Constrained Submodular Maximization
inferred← citeshttps://doi.org/10.48550/arxiv.2107.07103openalex-snapshot
On Optimal Approximations for $k$-Submodular Maximization via Multilinear Extension
inferred← citeshttps://doi.org/10.5555/2133036.2133118openalex-snapshot
Multi-budgeted matchings and matroid intersection via dependent rounding
inferred← citeshttps://doi.org/10.5555/2627817.2627840openalex-snapshot
Local distribution and the symmetry gap: approximability of multiway partitioning problems
inferred← citeshttps://doi.org/10.70675/2add6a02z4d65z48d5zbe20z40b1b5acd6c8openalex-snapshot
Apprentissage efficient dans les problèmes de semi-bandits stochastiques combinatoires
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.