On the public citation graph
Online Submodular Maximization with Preemption
0 signed · 73 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/3-540-44666-4_17openalex-snapshot
0.863-Approximation Algorithm for MAX DICUT
inferredcites →https://doi.org/10.1007/3-540-45465-9_26openalex-snapshot
Removable Online Knapsack Problems
inferredcites →https://doi.org/10.1007/3-540-47867-1_6openalex-snapshot
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
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-10841-9_52openalex-snapshot
Randomized Online Algorithms for the Buyback Problem
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-642-22006-7_29openalex-snapshot
Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm
inferredcites →https://doi.org/10.1007/978-3-642-22935-0_19openalex-snapshot
Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract)
inferredcites →https://doi.org/10.1007/bf01588971openalex-snapshot
An analysis of approximations for maximizing submodular set functions—I
inferredcites →https://doi.org/10.1007/s00453-008-9236-5openalex-snapshot
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
inferredcites →https://doi.org/10.1007/s00453-013-9806-zopenalex-snapshot
Oblivious Algorithms for the Maximum Directed Cut Problem
inferredcites →https://doi.org/10.1007/s00453-013-9822-zopenalex-snapshot
Online Unweighted Knapsack Problem with Removal Cost
inferredcites →https://doi.org/10.1007/s10107-015-0900-7openalex-snapshot
Submodular maximization meets streaming: matchings, matroids, and more
inferredcites →https://doi.org/10.1007/s10878-010-9318-6openalex-snapshot
Online maximum directed cut
inferredcites →https://doi.org/10.1007/s10951-013-0321-5openalex-snapshot
Online scheduling with preemption or non-completion penalties
inferredcites →https://doi.org/10.1016/j.disopt.2013.02.002openalex-snapshot
Approximating the least core value and least core of cooperative games with supermodular costs
inferredcites →https://doi.org/10.1016/j.ic.2017.12.002openalex-snapshot
Improved bounds for randomized preemptive online matching
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/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.1023/a:1022933824889openalex-snapshot
Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms
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.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
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.2011.46openalex-snapshot
A Unified Continuous Greedy Algorithm for Submodular Maximization
inferredcites →https://doi.org/10.1109/focs.2012.73openalex-snapshot
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
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.1109/sfcs.2005.53openalex-snapshot
Noise stability of functions with low in.uences invariance and optimality
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/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.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
inferredcites →https://doi.org/10.1145/2500121openalex-snapshot
Submodular secretary problem and extensions
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.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.25.8.808openalex-snapshot
Note—On “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.48550/arxiv.1007.1632openalex-snapshot
Submodular Maximization by Simulated Annealing
inferredcites →https://doi.org/10.48550/arxiv.1207.1394openalex-snapshot
Near-optimal Nonmyopic Value of Information in Graphical Models
inferredcites →https://doi.org/10.48550/arxiv.math/0503503openalex-snapshot
Noise stability of functions with low influences: invariance and optimality
inferredcites →https://doi.org/10.5555/1496770.1496907openalex-snapshot
An online mechanism for ad slot reservations with cancellations
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.1007/978-3-030-86523-8_10openalex-snapshot
Very Fast Streaming Submodular Function Maximization
inferred← citeshttps://doi.org/10.1007/978-3-030-92681-6_9openalex-snapshot
A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-25201-3_2openalex-snapshot
Computing Online Average Happiness Maximization Sets over Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-031-49611-0_19openalex-snapshot
Efficient Algorithms for k-Submodular Function Maximization with p-System and d-Knapsack Constraint
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-981-96-4448-3_4openalex-snapshot
Dynamic Algorithms for Submodular Maximization with a p-Matchoid Constraint
inferred← citeshttps://doi.org/10.1007/s00453-021-00850-7openalex-snapshot
Online Budgeted Maximum Coverage
inferred← citeshttps://doi.org/10.1007/s10878-022-00898-3openalex-snapshot
Online algorithms for the maximum k-interval coverage problem
inferred← citeshttps://doi.org/10.1007/s10878-026-01395-7openalex-snapshot
On maximizing k-submodular functions under p-system and d-knapsack constraints
inferred← citeshttps://doi.org/10.1007/s11590-023-01979-wopenalex-snapshot
Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.11.011openalex-snapshot
Submodular maximization over data streams with differential privacy noise
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116210openalex-snapshot
Online happiness maximization queries
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/ijcnn64981.2025.11229191openalex-snapshot
TActiLE: Tiny Active LEarning for wearable devices
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/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/3736252.3742481openalex-snapshot
Optimality of Non-Adaptive Algorithms in Online Submodular Welfare Maximization with Stochastic Outcomes
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.26599/tst.2022.9010013openalex-snapshot
Maximizing Submodular+Supermodular Functions Subject to a Fairness Constraint
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.6openalex-snapshot
Optimal Streaming Algorithms for Submodular Maximization with Cardinality 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.