On the public citation graph
Submodular secretary problem and extensions
0 signed · 127 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.1006/jctb.2000.1989openalex-snapshot
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
inferredcites →https://doi.org/10.1007/11944874_35openalex-snapshot
Secretary Problems with Competing Employers
inferredcites →https://doi.org/10.1007/3-540-36478-1_2openalex-snapshot
Submodular Functions, Matroids, and Certain Polyhedra
inferredcites →https://doi.org/10.1007/978-0-387-44956-2_22openalex-snapshot
Recognizing the Maximum of a Sequence
inferredcites →https://doi.org/10.1007/978-3-540-72792-7_15openalex-snapshot
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
inferredcites →https://doi.org/10.1007/978-3-540-74208-1_2openalex-snapshot
A Knapsack Secretary Problem with Applications
inferredcites →https://doi.org/10.1007/978-3-540-92185-1_53openalex-snapshot
Stochastic Submodular Maximization
inferredcites →https://doi.org/10.1007/978-3-642-15369-3_4openalex-snapshot
Submodular Secretary Problem and Extensions
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-68874-4openalex-snapshot
Mathematical Programming the State of the Art: Bonn 1982
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/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.1016/0304-4149(91)90086-ropenalex-snapshot
Optimal choice and assignment of the best m of n randomly arriving items
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.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.1080/01621459.1966.10502008openalex-snapshot
Recognizing the Maximum of a Sequence
inferredcites →https://doi.org/10.1080/07474948308836035openalex-snapshot
The d choice secretary problem
inferredcites →https://doi.org/10.1109/focs.2004.49openalex-snapshot
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
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/focs.2009.24openalex-snapshot
Symmetry and Approximability of Submodular Maximization Problems
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/090779346openalex-snapshot
Maximizing Non-monotone Submodular Functions
inferredcites →https://doi.org/10.1137/s0895480195290017openalex-snapshot
Improved Algorithms and Analysis for Secretary Problems and Generalizations
inferredcites →https://doi.org/10.1145/1132516.1132523openalex-snapshot
On maximizing welfare when utility functions are subadditive
inferredcites →https://doi.org/10.1145/1399589.1399596openalex-snapshot
Online auctions and generalized secretary problems
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/502090.502096openalex-snapshot
A combinatorial strongly polynomial algorithm for minimizing submodular functions
inferredcites →https://doi.org/10.1145/988772.988784openalex-snapshot
Adaptive limited-supply online auctions
inferredcites →https://doi.org/10.1184/r1/6603722openalex-snapshot
Automated Online Mechanism Design and Prophet Inequalities
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.5.4.481openalex-snapshot
The Optimal Choice of a Subset of a Population
inferredcites →https://doi.org/10.2307/1402748openalex-snapshot
The Secretary Problem and Its Extensions: A Review
inferredcites →https://doi.org/10.5555/1070432.1070519openalex-snapshot
A multiple-choice secretary algorithm with applications to online auctions
inferredcites →https://doi.org/10.5555/1283383.1283429openalex-snapshot
Matroids, secretary problems, and online mechanisms
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.1007/978-1-4939-2864-4_760openalex-snapshot
Secretary Problems and Online Auctions
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_31openalex-snapshot
Online Maximum k-Interval Coverage Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-93112-3_10openalex-snapshot
Matroid Secretary via Labeling Schemes
inferred← citeshttps://doi.org/10.1007/978-3-032-03639-1_22openalex-snapshot
Online Budget-Feasible Mechanism Design with Predictions
inferred← citeshttps://doi.org/10.1007/978-3-319-26977-1_2openalex-snapshot
Centralized Submodular Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-41168-2_9openalex-snapshot
Know When to Persist: Deriving Value from a Stream Buffer
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_760-1openalex-snapshot
Secretary Problems and Online Auctions
inferred← citeshttps://doi.org/10.1007/978-3-642-36694-9_22openalex-snapshot
Advances on Matroid Secretary Problems: Free Order Model and Laminar Case
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-981-97-9543-7_3openalex-snapshot
Scheduling Optimization Methodology
inferred← citeshttps://doi.org/10.1007/s00224-015-9642-4openalex-snapshot
The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems
inferred← citeshttps://doi.org/10.1007/s00446-018-0327-5openalex-snapshot
Secretary markets with local information
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-023-01026-5openalex-snapshot
Algorithms for maximizing monotone submodular function minus modular function under noise
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103633openalex-snapshot
Fair allocation of indivisible goods: Beyond additive valuations
inferred← citeshttps://doi.org/10.1016/j.comcom.2019.02.003openalex-snapshot
Hey, influencer! Message delivery to social central nodes in social opportunistic networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2016.03.016openalex-snapshot
An incentive mechanism with privacy protection in mobile crowdsourcing systems
inferred← citeshttps://doi.org/10.1016/j.comnet.2018.02.008openalex-snapshot
Truthful incentive mechanism with location privacy-preserving for mobile crowdsourcing systems
inferred← citeshttps://doi.org/10.1016/j.comnet.2020.107144openalex-snapshot
A worker-selection incentive mechanism for optimizing platform-centric mobile crowdsourcing systems
inferred← citeshttps://doi.org/10.1016/j.eswa.2021.115485openalex-snapshot
A probabilistic graph-based method to solve precision-diversity dilemma in recommender systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.021openalex-snapshot
Know when to persist: Deriving value from a stream buffer
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.003openalex-snapshot
Monotone k-submodular secretary problems: Cardinality and knapsack constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116210openalex-snapshot
Online happiness maximization queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116260openalex-snapshot
Online budget-feasible mechanism design with predictions
inferred← citeshttps://doi.org/10.1063/5.0133330openalex-snapshot
A survey on auction based and game based incentive mechanisms in mobile crowd sensing
inferred← citeshttps://doi.org/10.1109/comst.2014.2387836openalex-snapshot
A Survey of Incentive Mechanisms for Participatory Sensing
inferred← citeshttps://doi.org/10.1109/focs.2014.42openalex-snapshot
O(log log Rank) Competitive Ratio for the Matroid Secretary Problem
inferred← citeshttps://doi.org/10.1109/focs.2015.37openalex-snapshot
The Submodular Secretary Problem Goes Linear
inferred← citeshttps://doi.org/10.1109/icra.2018.8460759openalex-snapshot
Heterogeneous Multi-Robot System for Exploration and Strategic Water Sampling
inferred← citeshttps://doi.org/10.1109/ijcnn64981.2025.11227433openalex-snapshot
BDARec: Balancing Diversity and Accuracy of Recommendation Model with Graph Neural Networks
inferred← citeshttps://doi.org/10.1109/infocom41043.2020.9155242openalex-snapshot
Dynamic User Recruitment with Truthful Pricing for Mobile CrowdSensing
inferred← citeshttps://doi.org/10.1109/infocom48880.2022.9796743openalex-snapshot
Worker Selection Towards Data Completion for Online Sparse Crowdsensing
inferred← citeshttps://doi.org/10.1109/infocom48880.2022.9796947openalex-snapshot
Subset Selection for Hybrid Task Scheduling with General Cost Constraints
inferred← citeshttps://doi.org/10.1109/iwqos.2018.8624185openalex-snapshot
Data Utility Maximization When Leveraging Crowdsensing in Machine Learning
inferred← citeshttps://doi.org/10.1109/mfi.2017.8170416openalex-snapshot
Online decision making for stream-based robotic sampling via submodular optimization
inferred← citeshttps://doi.org/10.1109/tcss.2019.2907059openalex-snapshot
An Optimization and Auction-Based Incentive Mechanism to Maximize Social Welfare for Mobile Crowdsourcing
inferred← citeshttps://doi.org/10.1109/tmc.2018.2879098openalex-snapshot
A Prediction-Based User Selection Framework for Heterogeneous Mobile CrowdSensing
inferred← citeshttps://doi.org/10.1109/tmc.2019.2921962openalex-snapshot
CEDAR: A Cost-Effective Crowdsensing System for Detecting and Localizing Drones
inferred← citeshttps://doi.org/10.1109/tmc.2024.3430389openalex-snapshot
Trading off Coverage and Emergency for Hybrid Task Scheduling in Traffic Anomaly Detection
inferred← citeshttps://doi.org/10.1109/tnet.2021.3083955openalex-snapshot
Dynamic Online User Recruitment With (Non-) Submodular Utility in Mobile CrowdSensing
inferred← citeshttps://doi.org/10.1137/1.9781611973105.8openalex-snapshot
Matroid Secretary for Regular and Decomposable Matroids
inferred← citeshttps://doi.org/10.1137/1.9781611973730.80openalex-snapshot
Online Submodular Maximization with Preemption
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch72openalex-snapshot
Online Contention Resolution Schemes
inferred← citeshttps://doi.org/10.1137/1.9781611975031.47openalex-snapshot
Strong Algorithms for the Ordinal Matroid Secretary Problem
inferred← citeshttps://doi.org/10.1137/16m1105220openalex-snapshot
The Submodular Secretary Problem Goes Linear
inferred← citeshttps://doi.org/10.1137/18m1226130openalex-snapshot
Online Contention Resolution Schemes with Applications to Bayesian Selection Problems
inferred← citeshttps://doi.org/10.1137/21m1411822openalex-snapshot
A Framework for the Secretary Problem on the Intersection of Matroids
inferred← citeshttps://doi.org/10.1145/2746539.2746602openalex-snapshot
Secretary Problems with Non-Uniform Arrival Order
inferred← citeshttps://doi.org/10.1145/2809814openalex-snapshot
Fast Greedy Algorithms in MapReduce and Streaming
inferred← citeshttps://doi.org/10.1145/3219166.3219211openalex-snapshot
Prophets and Secretaries with Overbooking
inferred← citeshttps://doi.org/10.1145/3219166.3219238openalex-snapshot
Fair Allocation of Indivisible Goods
inferred← citeshttps://doi.org/10.1145/3242770openalex-snapshot
Online Submodular Maximization with Free Disposal
inferred← citeshttps://doi.org/10.1145/3309764openalex-snapshot
Online Submodular Maximization with Preemption
inferred← citeshttps://doi.org/10.1145/3326285.3329043openalex-snapshot
Selecting optimal mobile users for long-term environmental monitoring by crowdsourcing
inferred← citeshttps://doi.org/10.1145/3328526.3329622openalex-snapshot
Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives
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/3736252.3742668openalex-snapshot
A Competitive Posted-Price Mechanism for Online Budget-Feasible Auctions
inferred← citeshttps://doi.org/10.1145/3774904.3792478openalex-snapshot
Additively Competitive Secretaries
inferred← citeshttps://doi.org/10.1177/09266801251388373openalex-snapshot
Spatial crowdsourcing: An AI-based quality-aware task allocation and procrastination prevention mechanism
inferred← citeshttps://doi.org/10.1287/moor.2017.0876openalex-snapshot
A Simple O (log log(rank))-Competitive Algorithm for the Matroid Secretary Problem
inferred← citeshttps://doi.org/10.1287/moor.2020.1083openalex-snapshot
Strong algorithms for the ordinal matroid secretary problem
inferred← citeshttps://doi.org/10.1287/moor.2021.1208openalex-snapshot
Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online
inferred← citeshttps://doi.org/10.1287/moor.2023.0210openalex-snapshot
Robust Online Selection with Uncertain Offer Acceptance
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20437openalex-snapshot
Secretary Matching with Vertex Arrivals and No Rejections
inferred← citeshttps://doi.org/10.2139/ssrn.6396359openalex-snapshot
The Probability of an Event Occurring
inferred← citeshttps://doi.org/10.24963/ijcai.2022/36openalex-snapshot
Online Approval Committee Elections
inferred← citeshttps://doi.org/10.26599/tst.2022.9010033openalex-snapshot
Approximating ($m_{B},m_{P}$)-Monotone BP Maximization and Extensions
inferred← citeshttps://doi.org/10.48550/arxiv.1404.4473openalex-snapshot
A Simple $O(\log\log(\mathrm{rank}))$-Competitive Algorithm for the Matroid Secretary Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1502.02155openalex-snapshot
Secretary Problems with Non-Uniform Arrival Order
inferred← citeshttps://doi.org/10.48550/arxiv.1604.03009openalex-snapshot
Know When to Persist: Deriving Value from a Stream Buffer
inferred← citeshttps://doi.org/10.48550/arxiv.1704.00222openalex-snapshot
Fair Allocation of Indivisible Goods: Improvement and Generalization
inferred← citeshttps://doi.org/10.48550/arxiv.1809.07299openalex-snapshot
The Warm-starting Sequential Selection Problem and its Multi-round Extension
inferred← citeshttps://doi.org/10.48550/arxiv.1905.04941openalex-snapshot
An improved algorithm for the submodular secretary problem with a cardinality constraint
inferred← citeshttps://doi.org/10.48550/arxiv.1907.00312openalex-snapshot
Competitive Algorithms for Online Budget-Constrained Continuous DR-Submodular Problems
inferred← citeshttps://doi.org/10.48550/arxiv.2001.00894openalex-snapshot
Submodular Matroid Secretary Problem with Shortlists
inferred← citeshttps://doi.org/10.48550/arxiv.2010.01901openalex-snapshot
Improved Submodular Secretary Problem with Shortlists
inferred← citeshttps://doi.org/10.48550/arxiv.2011.10659openalex-snapshot
Efficient stream-based Max-Min diversification with minimal failure rate
inferred← citeshttps://doi.org/10.70675/7c077eefz7a43z411bz9443zd07cf97770b4openalex-snapshot
Convex and online optimization : applications to scheduling and selection problems
inferred← citeshttps://doi.org/10.70675/865a2ef4z215fz4d21z90ccz60f9c078be9eopenalex-snapshot
Sequential Resource Allocation for network diffusion control
inferred← citeshttps://doi.org/10.7916/d8-cvbj-6c48openalex-snapshot
Submodular Secretary Problem with Shortlists under General 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.