On the public citation graph

Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates

0 signed · 99 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/jagm.2000.1145openalex-snapshot
Approximation Algorithms for Dispersion Problems
inferredcites →https://doi.org/10.1007/3-540-61422-2_120openalex-snapshot
Facility dispersion and remote subgraphs
inferredcites →https://doi.org/10.1007/978-3-319-08326-1_60openalex-snapshot
Improved Approximation Guarantee for Max Sum Diversification with Parameterised Triangle Inequality
inferredcites →https://doi.org/10.1007/978-3-642-14162-1_23openalex-snapshot
Approximation Algorithms for Diversified Search Ranking
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/s00453-003-1074-xopenalex-snapshot
Maximum Dispersion and Geometric Maximum Weight Cliques
inferredcites →https://doi.org/10.1007/s00453-007-9142-2openalex-snapshot
An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs
inferredcites →https://doi.org/10.1007/s10791-009-9123-yopenalex-snapshot
LETOR: A benchmark collection for research on learning to rank for information retrieval
inferredcites →https://doi.org/10.1016/0020-0190(88)90174-3openalex-snapshot
A study on two geometric location problems
inferredcites →https://doi.org/10.1016/0377-2217(89)90420-7openalex-snapshot
Analytical models for locating undesirable facilities
inferredcites →https://doi.org/10.1016/0377-2217(90)90297-oopenalex-snapshot
The discrete p-dispersion problem
inferredcites →https://doi.org/10.1016/s0167-6377(00)00058-4openalex-snapshot
Maximum dispersion problem in dense graphs
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.1016/s0167-6377(97)00034-5openalex-snapshot
Approximation algorithms for maximum dispersion
inferredcites →https://doi.org/10.1017/s000497270004140xopenalex-snapshot
Comments on bases in dependence structures
inferredcites →https://doi.org/10.1109/asru.2009.5373486openalex-snapshot
Graph-based submodular selection for extractive summarization
inferredcites →https://doi.org/10.1109/icde.2011.5767846openalex-snapshot
On query result diversification
inferredcites →https://doi.org/10.1111/j.1538-4632.1987.tb00133.xopenalex-snapshot
Programming Models for Facility Dispersion: The p‐Dispersion and Maxisum Dispersion Problems
inferredcites →https://doi.org/10.1137/080733991openalex-snapshot
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
inferredcites →https://doi.org/10.1137/s0097539705447037openalex-snapshot
Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
inferredcites →https://doi.org/10.1137/s0097539795286612openalex-snapshot
On Syntactic versus Computational Views of Approximability
inferredcites →https://doi.org/10.1145/1148170.1148245openalex-snapshot
Less is more
inferredcites →https://doi.org/10.1145/1390156.1390255openalex-snapshot
Learning diverse rankings with multi-armed bandits
inferredcites →https://doi.org/10.1145/1390156.1390310openalex-snapshot
Predicting diverse subsets using structural SVMs
inferredcites →https://doi.org/10.1145/1498759.1498766openalex-snapshot
Diversifying search results
inferredcites →https://doi.org/10.1145/1516360.1516404openalex-snapshot
It takes variety to make a world
inferredcites →https://doi.org/10.1145/1526709.1526761openalex-snapshot
An axiomatic approach for result diversification
inferredcites →https://doi.org/10.1145/1772690.1772770openalex-snapshot
Diversifying web search results
inferredcites →https://doi.org/10.1145/1835449.1835506openalex-snapshot
DivQ
inferredcites →https://doi.org/10.1145/1860702.1860709openalex-snapshot
Search result diversification
inferredcites →https://doi.org/10.1145/1935826.1935872openalex-snapshot
Dynamic ranked retrieval
inferredcites →https://doi.org/10.1145/1935826.1935897openalex-snapshot
Multi-dimensional search result diversification
inferredcites →https://doi.org/10.1145/2009916.2009996openalex-snapshot
Incremental diversification for very large sets
inferredcites →https://doi.org/10.1145/2009916.2009997openalex-snapshot
Intent-aware search result diversification
inferredcites →https://doi.org/10.1145/2213556.2213580openalex-snapshot
Max-Sum diversification, monotone submodular functions and dynamic updates
inferredcites →https://doi.org/10.1145/2487575.2487636openalex-snapshot
Diversity maximization under matroid constraints
inferredcites →https://doi.org/10.1145/2746539.2746600openalex-snapshot
Sum-of-squares Lower Bounds for Planted Clique
inferredcites →https://doi.org/10.1145/2795403.2795405openalex-snapshot
Beyond Independent Relevance
inferredcites →https://doi.org/10.1145/290941.291025openalex-snapshot
The use of MMR, diversity-based reranking for reordering documents and producing summaries
inferredcites →https://doi.org/10.1145/3130348.3130369openalex-snapshot
The Use of MMR, Diversity-Based Reranking for Reordering Documents and Producing Summaries
inferredcites →https://doi.org/10.1145/860435.860440openalex-snapshot
Beyond independent relevance
inferredcites →https://doi.org/10.1145/956750.956769openalex-snapshot
Maximizing the spread of influence through a social network
inferredcites →https://doi.org/10.1287/opre.42.2.299openalex-snapshot
Heuristic and Special Case Algorithms for Dispersion Problems
inferredcites →https://doi.org/10.14778/1687627.1687663openalex-snapshot
Structured search result differentiation
inferredcites →https://doi.org/10.14778/3402755.3402769openalex-snapshot
BROAD
inferredcites →https://doi.org/10.14778/3402755.3402779openalex-snapshot
DivDB
inferredcites →https://doi.org/10.1609/aaai.v31i1.10926openalex-snapshot
Scalable Feature Selection via Distributed Diversity Maximization
inferredcites →https://doi.org/10.48550/arxiv.1401.6697openalex-snapshot
Weakly Submodular Functions
inferredcites →https://doi.org/10.48550/arxiv.1511.02402openalex-snapshot
Max-Sum Diversification, Monotone Submodular Functions and Semi-metric Spaces

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4782231openalex-extracted
Divgcl: A Graph Contrastive Learning Model for Diverse Recommendation
inferred← citeshttps://doi.org/10.1002/ett.4398openalex-snapshot
Re‐ranking with multiple objective optimization in recommender system
inferred← citeshttps://doi.org/10.1007/978-3-030-04693-4_1openalex-snapshot
Some Easy and Some Not so Easy Geometric Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_46openalex-snapshot
Diverse Partitions of Colored Points
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_14openalex-snapshot
Obtaining Approximately Optimal and Diverse Solutions via Dispersion
inferred← citeshttps://doi.org/10.1007/978-3-031-42941-5_6openalex-snapshot
Diversification of Top-k Geosocial Queries
inferred← citeshttps://doi.org/10.1007/978-3-032-04700-7_14openalex-snapshot
Computing Diverse and Nice Triangulations
inferred← citeshttps://doi.org/10.1007/s00778-021-00681-6openalex-snapshot
Maximum and top-k diversified biclique search at scale
inferred← citeshttps://doi.org/10.1007/s10618-021-00811-2openalex-snapshot
Provable randomized rounding for minimum-similarity diversification
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/s10994-026-07098-8openalex-snapshot
Top-k Diverse Polarized Communities in Signed Networks
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103737openalex-snapshot
Result diversification by multi-objective evolutionary algorithms with theoretical guarantees
inferred← citeshttps://doi.org/10.1016/j.dcan.2023.02.002openalex-snapshot
Diversified and compatible web APIs recommendation based on game theory in IoT
inferred← citeshttps://doi.org/10.1016/j.fmre.2023.04.001openalex-snapshot
Result diversification with negative type distances by multi-objective evolutionary algorithms
inferred← citeshttps://doi.org/10.1016/j.ins.2019.10.021openalex-snapshot
On efficiently diversified top-k geo-social keyword query processing in road networks
inferred← citeshttps://doi.org/10.1109/access.2026.3727233openalex-snapshot
Efficient and Robust Data Sampling Strategy for Large-Scale In-the-Wild Text-to-Speech Training
inferred← citeshttps://doi.org/10.1109/icde.2018.00086openalex-snapshot
Finding Diverse Neighbors in High Dimensional Space
inferred← citeshttps://doi.org/10.1109/icdm.2019.00128openalex-snapshot
Diversity-Aware Recommendation by User Interest Domain Coverage Maximization
inferred← citeshttps://doi.org/10.1109/isncc66965.2025.11250449openalex-snapshot
A Formal Model for Path Set Attribute Calculation in Network Systems
inferred← citeshttps://doi.org/10.1109/isspit.2017.8388660openalex-snapshot
Towards recommending diverse seasonal cooking recipes: A preliminary study based on monthly view data
inferred← citeshttps://doi.org/10.1109/jiot.2023.3278282openalex-snapshot
User-Assisted Base Station Caching and Cooperative Prefetching for High-Speed Railway Systems
inferred← citeshttps://doi.org/10.1109/sose62363.2024.00016openalex-snapshot
MCBA: A Matroid Constraint-Based Approach for Composite Service Recommendation Considering Compatibility and Diversity : (Invited Paper)
inferred← citeshttps://doi.org/10.1109/tii.2021.3133614openalex-snapshot
Efficient Web APIs Recommendation With Privacy-Preservation for Mobile App Development in Industry 4.0
inferred← citeshttps://doi.org/10.1109/tkde.2018.2820119openalex-snapshot
Diverse Relevance Feedback for Time Series with Autoencoder Based Summarizations
inferred← citeshttps://doi.org/10.1109/tkde.2026.3650879openalex-snapshot
Fast Diversified Top-k Rule Discovery via User-Guided Embeddings
inferred← citeshttps://doi.org/10.1109/tpami.2026.3665061openalex-snapshot
Tail Task Risk Minimization in Meta-Learning From Theoretical Advances to Practical Strategies
inferred← citeshttps://doi.org/10.1145/3184558.3186978openalex-snapshot
MetaExp
inferred← citeshttps://doi.org/10.1145/3375395.3387667openalex-snapshot
Efficient Indexes for Diverse Top-k Range Queries
inferred← citeshttps://doi.org/10.1145/3397271.3401213openalex-snapshot
Enhancing Recommendation Diversity using Determinantal Point Processes on Knowledge Graphs
inferred← citeshttps://doi.org/10.1145/3664647.3680909openalex-snapshot
Diversity Matters: User-Centric Multi-Interest Learning for Conversational Movie Recommendation
inferred← citeshttps://doi.org/10.1145/3677131openalex-snapshot
Discovering Top-k Relevant and Diversified Rules
inferred← citeshttps://doi.org/10.1145/3711896.3736950openalex-snapshot
Fair Diversity Maximization with Few Representatives
inferred← citeshttps://doi.org/10.1145/3749161openalex-snapshot
Differentially Private Explanations for Clusters
inferred← citeshttps://doi.org/10.1145/3774904.3792370openalex-snapshot
Online Advertising with Spatial Interactions
inferred← citeshttps://doi.org/10.1145/3816782.3819230openalex-snapshot
Composable Coresets for Fair Diversity Maximization
inferred← citeshttps://doi.org/10.14778/3712221.3712252openalex-snapshot
Representative Time Series Discovery for Data Exploration
inferred← citeshttps://doi.org/10.14778/3836663.3836679openalex-snapshot
Fast and Private Max-Sum Diversification
inferred← citeshttps://doi.org/10.1609/aaai.v35i5.16495openalex-snapshot
Finding Diverse Trees, Paths, and More
inferred← citeshttps://doi.org/10.1609/aaai.v35i8.16860openalex-snapshot
Differentially Private Decomposable Submodular Maximization
inferred← citeshttps://doi.org/10.1609/aaai.v37i10.26454openalex-snapshot
Diversity Maximization in the Presence of Outliers
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3683541/v1openalex-snapshot
Obtaining Approximately Optimal and Diverse Solutions via Dispersion
inferred← citeshttps://doi.org/10.24963/ijcai.2022/819openalex-snapshot
Towards Theoretically Grounded Evolutionary Learning
inferred← citeshttps://doi.org/10.26599/tst.2025.9010118openalex-snapshot
C-DAWAR: Towards Diversity-Aware Web APIs Recommendation for Mashup Creation Based on Contrastive Learning
inferred← citeshttps://doi.org/10.3233/faia200123openalex-snapshot
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings1
inferred← citeshttps://doi.org/10.33540/1991openalex-snapshot
On Geometric Measures and Their Computation
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.1810.02019openalex-snapshot
Seq2Slate: Re-ranking and Slate Optimization with RNNs
inferred← citeshttps://doi.org/10.48550/arxiv.1911.06791openalex-snapshot
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings
inferred← citeshttps://doi.org/10.70675/379e3491z0dcez4caaza065z59dd5e02e4cbopenalex-snapshot
Towards diversified recommendations
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.