On the public citation graph
Accelerated greedy algorithms for maximizing submodular set functions
0 signed · 372 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/nav.3800080104openalex-snapshot
Fixed‐cost transportation problems
inferredcites →https://doi.org/10.1007/3-540-36478-1_2openalex-snapshot
Submodular Functions, Matroids, and Certain Polyhedra
inferredcites →https://doi.org/10.1007/bf01580681openalex-snapshot
Some theoretical implications of local optimization
inferredcites →https://doi.org/10.1007/bf01584989openalex-snapshot
Exact and approximate solutions to the multisource weber problem
inferredcites →https://doi.org/10.1007/bf01588971openalex-snapshot
An analysis of approximations for maximizing submodular set functions—I
inferredcites →https://doi.org/10.1007/bf02997589openalex-snapshot
Multiflots de coût minimal avec fonctions de coût concaves
inferredcites →https://doi.org/10.1080/00207177208932320openalex-snapshot
On the fixed cost flow problem†
inferredcites →https://doi.org/10.1090/s0002-9939-1956-0078686-7openalex-snapshot
On the shortest spanning subtree of a graph and the traveling salesman problem
inferredcites →https://doi.org/10.1287/opre.20.1.94openalex-snapshot
The Transportation-Location Problem
inferredcites →https://doi.org/10.1287/trsc.7.1.49openalex-snapshot
Network Design with Fixed and Variable Cost Elements
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.3230190305openalex-snapshot
Networks synthesis and optimum network design problems: Models, solution methods and applications
inferred← citeshttps://doi.org/10.1002/prot.25461openalex-snapshot
Choosing non‐redundant representative subsets of protein sequence data sets using submodular optimization
inferred← citeshttps://doi.org/10.1007/0-387-23830-1_1openalex-snapshot
Data Correcting Algorithms in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_84openalex-snapshot
Data Correcting Approach for Routing and Location in Networks
inferred← citeshttps://doi.org/10.1007/978-1-4614-5286-7_2openalex-snapshot
Maximization of Submodular Functions: Theory and Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4614-5286-7_3openalex-snapshot
Data Correcting Approach for the Maximization of Submodular Functions
inferred← citeshttps://doi.org/10.1007/978-1-4614-5286-7_4openalex-snapshot
Data Correcting Approach for the Simple Plant Location Problem
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_89-1openalex-snapshot
Practical Submodular Maximization: A Primer
inferred← citeshttps://doi.org/10.1007/978-3-030-16194-1_15openalex-snapshot
Multi-Document Extractive Summarization as a Non-linear Combinatorial Optimization Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-19212-9_32openalex-snapshot
Some Experiments with Submodular Function Maximization via Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-29911-8_27openalex-snapshot
Convex Hull Approximation of Nearly Optimal Lasso Solutions
inferred← citeshttps://doi.org/10.1007/978-3-030-44051-0_25openalex-snapshot
Resource-Aware Algorithms for Distributed Loop Closure Detection with Provable Performance Guarantees
inferred← citeshttps://doi.org/10.1007/978-3-030-67664-3_1openalex-snapshot
Algorithms for Optimizing the Ratio of Monotone k-Submodular Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-87756-9_20openalex-snapshot
Interactive Optimization of Submodular Functions Under Matroid Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-00126-0_43openalex-snapshot
Data Source Selection in Federated Learning: A Submodular Optimization Approach
inferred← citeshttps://doi.org/10.1007/978-3-031-01850-3openalex-snapshot
Information and Influence Propagation in Social Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-14721-0_12openalex-snapshot
Greedy Decremental Quick Hypervolume Subset Selection Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-20083-0_28openalex-snapshot
$$\ell _\infty $$-Robustness and Beyond: Unleashing Efficient Adversarial Training
inferred← citeshttps://doi.org/10.1007/978-3-031-26351-4_41openalex-snapshot
COLLIDER: A Robust Training Framework for Backdoor Data
inferred← citeshttps://doi.org/10.1007/978-3-031-70365-2_17openalex-snapshot
Introducing Total Harmonic Resistance for Graph Robustness Under Edge Deletions
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-032-02049-9_21openalex-snapshot
Influential Slot and Tag Selection in Billboard Advertisement
inferred← citeshttps://doi.org/10.1007/978-3-032-09315-8_16openalex-snapshot
Optimizing Energy in Supervised Learning with Data Summarization: A Comparative Study
inferred← citeshttps://doi.org/10.1007/978-3-319-12691-3_40openalex-snapshot
Optimal Containment of Misinformation in Social Media: A Scenario-Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-21786-4_8openalex-snapshot
Social Influence Spectrum with Guarantees: Computing More in Less Time
inferred← citeshttps://doi.org/10.1007/978-3-319-23105-1_4openalex-snapshot
The Independent Cascade and Linear Threshold Models
inferred← citeshttps://doi.org/10.1007/978-3-319-28262-6_6openalex-snapshot
Spatially-Dimension-Adaptive Sparse Grids for Online Learning
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-31753-3_24openalex-snapshot
Building Compact Lexicons for Cross-Domain SMT by Mining Near-Optimal Pattern Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-46128-1_9openalex-snapshot
Maximizing Time-Decaying Influence in Social Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-55394-8_7openalex-snapshot
Social Media Summarization
inferred← citeshttps://doi.org/10.1007/978-3-319-66182-7_55openalex-snapshot
A Submodular Approach to Create Individualized Parcellations of the Human Brain
inferred← citeshttps://doi.org/10.1007/978-3-319-70087-8_53openalex-snapshot
Efficient Neighborhood Covering Reduction with Submodular Function Optimization
inferred← citeshttps://doi.org/10.1007/978-981-95-1446-5_2openalex-snapshot
Fast and Numerically Stable Implementation of Rate Constant Matrix Contraction Method
inferred← citeshttps://doi.org/10.1007/978-981-97-7238-4_21openalex-snapshot
Identifying Rank-Happiness Maximizing Sets Under Group Fairness Constraints
inferred← citeshttps://doi.org/10.1007/bf02998391openalex-snapshot
Algorithmes gloutons et fonctions surmodulaires: Théorie et application à un problème de sécurité dans les réseaux de télécommunications
inferred← citeshttps://doi.org/10.1007/bfb0006144openalex-snapshot
An accelerated experimental design algorithm
inferred← citeshttps://doi.org/10.1007/s00332-022-09806-9openalex-snapshot
Inadequacy of Linear Methods for Minimal Sensor Placement and Feature Selection in Nonlinear Systems: A New Approach Using Secants
inferred← citeshttps://doi.org/10.1007/s10115-014-0800-9openalex-snapshot
Triangle minimization in large networks
inferred← citeshttps://doi.org/10.1007/s10287-012-0158-yopenalex-snapshot
Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios
inferred← citeshttps://doi.org/10.1007/s10489-012-0336-1openalex-snapshot
Multi-document summarization via submodularity
inferred← citeshttps://doi.org/10.1007/s10618-010-0203-9openalex-snapshot
Summarizing transactional databases with overlapped hyperrectangles
inferred← citeshttps://doi.org/10.1007/s10618-010-0209-3openalex-snapshot
Maximum entropy models and subjective interestingness: an application to tiles in binary databases
inferred← citeshttps://doi.org/10.1007/s10618-025-01090-xopenalex-snapshot
Forming coordinated teams that balance task coverage and expert workload
inferred← citeshttps://doi.org/10.1007/s10898-004-5909-zopenalex-snapshot
A Multilevel Search Algorithm for the Maximization of Submodular Functions Applied to the Quadratic Cost Partition Problem
inferred← citeshttps://doi.org/10.1007/s10957-023-02353-7openalex-snapshot
Algorithms for Cardinality-Constrained Monotone DR-Submodular Maximization with Low Adaptivity and Query Complexity
inferred← citeshttps://doi.org/10.1007/s10994-022-06150-7openalex-snapshot
Explaining short text classification with diverse synthetic exemplars and counter-exemplars
inferred← citeshttps://doi.org/10.1007/s11263-023-01860-4openalex-snapshot
Adversarial Coreset Selection for Efficient Robust Training
inferred← citeshttps://doi.org/10.1007/s11721-022-00213-0openalex-snapshot
Sample greedy based task allocation for multiple robot systems
inferred← citeshttps://doi.org/10.1007/s13278-023-01137-1openalex-snapshot
Greedy optimization of resistance-based graph robustness with global and local edge insertions
inferred← citeshttps://doi.org/10.1007/s41060-017-0082-xopenalex-snapshot
Preventing the diffusion of information to vulnerable users while preserving PageRank
inferred← citeshttps://doi.org/10.1007/s42519-021-00210-2openalex-snapshot
Incremental Space-Filling Design Based on Coverings and Spacings: Improving Upon Low Discrepancy Sequences
inferred← citeshttps://doi.org/10.1007/s42979-020-0121-xopenalex-snapshot
Lazy Forward Differential Evolution for Influence Maximization in Large Data Network
inferred← citeshttps://doi.org/10.1016/0166-218x(85)90035-6openalex-snapshot
Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
inferred← citeshttps://doi.org/10.1016/b978-0-12-394292-0.00016-3openalex-snapshot
Efficient Sampling of SCHEMA Chimera Families to Identify Useful Sequence Elements
inferred← citeshttps://doi.org/10.1016/b978-0-443-14081-5.00090-8openalex-snapshot
Submodular Maximization Subject to Uniform and Partition Matroids: From Theory to Practical Applications and Distributed Solutions
inferred← citeshttps://doi.org/10.1016/j.aei.2018.02.004openalex-snapshot
Robust sensor placement for pipeline monitoring: Mixed integer and greedy optimization
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103328openalex-snapshot
On the equivalence of optimal recommendation sets and myopically optimal query sets
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.automatica.2016.06.005openalex-snapshot
Sensor placement for fault location identification in water networks: A minimum test cover approach
inferred← citeshttps://doi.org/10.1016/j.comnet.2014.08.024openalex-snapshot
Whom to follow: Efficient followee selection for cascading outbreak detection on online social networks
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105558openalex-snapshot
An iterative security game for computing robust and adaptive network flows
inferred← citeshttps://doi.org/10.1016/j.dam.2012.07.016openalex-snapshot
Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.01.004openalex-snapshot
Informative path planning as a maximum traveling salesman problem with submodular rewards
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.08.022openalex-snapshot
Maximization of submodular functions: Theory and enumeration algorithms
inferred← citeshttps://doi.org/10.1016/j.ins.2017.03.017openalex-snapshot
I/O-efficient calculation of H -group closeness centrality over disk-resident graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2018.10.036openalex-snapshot
Optimizing node discovery on networks: Problem definitions, fast algorithms, and observations
inferred← citeshttps://doi.org/10.1016/j.ins.2021.01.045openalex-snapshot
Learning adaptive criteria weights for active semi-supervised learning
inferred← citeshttps://doi.org/10.1016/j.ins.2021.11.080openalex-snapshot
Efficient processing of k-regret minimization queries with theoretical guarantees
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.04.004openalex-snapshot
Faster approximation algorithms for maximizing a monotone submodular function subject to a b -matching constraint
inferred← citeshttps://doi.org/10.1016/j.jocs.2017.11.001openalex-snapshot
Influence efficiency maximization: How can we spread information efficiently?
inferred← citeshttps://doi.org/10.1016/j.knosys.2022.109788openalex-snapshot
LUEM : Local User Engagement Maximization in Networks
inferred← citeshttps://doi.org/10.1016/j.measurement.2021.110370openalex-snapshot
Multi-objective optimization for sensor placement: An integrated combinatorial approach with reduced order model and Gaussian process
inferred← citeshttps://doi.org/10.1016/j.neucom.2016.05.087openalex-snapshot
User session level diverse reranking of search results
inferred← citeshttps://doi.org/10.1016/j.neucom.2018.05.110openalex-snapshot
Multi-label active learning based on submodular functions
inferred← citeshttps://doi.org/10.1016/j.renene.2011.03.045openalex-snapshot
A fast algorithm based on the submodular property for optimization of wind turbine positioning
inferred← citeshttps://doi.org/10.1016/j.sigpro.2014.03.018openalex-snapshot
Vertex selection via a multi-graph analysis
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.007openalex-snapshot
Beyond pointwise submodularity: Non-monotone adaptive submodular maximization in linear time
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.020openalex-snapshot
Influence maximization in the presence of vulnerable nodes: A ratio perspective
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115629openalex-snapshot
Submodular maximization subject to a knapsack constraint: Combinatorial algorithms with near-optimal adaptive complexity
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73239-0openalex-snapshot
Network Synthesis and Dynamic Network Optimization
inferred← citeshttps://doi.org/10.1017/cbo9781139177801.004openalex-snapshot
Submodular Function Maximization
inferred← citeshttps://doi.org/10.1017/s0962492919000035openalex-snapshot
Approximation algorithms in combinatorial scientific computing
inferred← citeshttps://doi.org/10.1023/a:1022503826877openalex-snapshot
Solving the Simple Plant Location Problem using a Data Correcting Approach
inferred← citeshttps://doi.org/10.1049/iet-rsn.2017.0075openalex-snapshot
Constrained robust submodular sensor selection with application to multistatic sonar arrays
inferred← citeshttps://doi.org/10.1073/pnas.1215251110openalex-snapshot
Navigating the protein fitness landscape with Gaussian processes
inferred← citeshttps://doi.org/10.1080/00949658808811099openalex-snapshot
Optimizing the measurement processing order for linear regression
inferred← citeshttps://doi.org/10.1080/08839514.2022.2034293openalex-snapshot
Feature Selection for Supervised Learning and Compression
inferred← citeshttps://doi.org/10.1088/1367-2630/aced66openalex-snapshot
Detecting the driver nodes of temporal networks
inferred← citeshttps://doi.org/10.1093/bioinformatics/btaa830openalex-snapshot
Prioritizing transcriptomic and epigenomic experiments using an optimization strategy that leverages imputed data
inferred← citeshttps://doi.org/10.1093/bioinformatics/btt436openalex-snapshot
Near-optimal experimental design for model selection in systems biology
inferred← citeshttps://doi.org/10.1101/051201openalex-snapshot
Eliminating redundancy among protein sequences using submodular optimization
inferred← citeshttps://doi.org/10.1109/acc.2013.6580451openalex-snapshot
The maximum traveling salesman problem with submodular rewards
inferred← citeshttps://doi.org/10.1109/acc.2016.7524914openalex-snapshot
Sensor placement for optimal Kalman filtering: Fundamental limits, submodularity, and algorithms
inferred← citeshttps://doi.org/10.1109/access.2020.3031964openalex-snapshot
A New Framework for Mobile Edge Caching by Proposing Flexible User in Heterogeneous Cellular Networks
inferred← citeshttps://doi.org/10.1109/access.2023.3293637openalex-snapshot
Learning to Sample: Data-Driven Sampling and Reconstruction of FRI Signals
inferred← citeshttps://doi.org/10.1109/acssc.2015.7421079openalex-snapshot
On the delay optimal user association in heterogeneous wireless networks
inferred← citeshttps://doi.org/10.1109/acssc.2017.8335544openalex-snapshot
Managing analog beams in mmWave networks
inferred← citeshttps://doi.org/10.1109/acssc.2017.8335611openalex-snapshot
Greed is good: Leveraging submodularity for antenna selection in Massive MIMO
inferred← citeshttps://doi.org/10.1109/asonam55673.2022.10068613openalex-snapshot
Faster Greedy Optimization of Resistance-based Graph Robustness
inferred← citeshttps://doi.org/10.1109/asru46091.2019.9003747openalex-snapshot
Efficient Semi-Supervised Learning for Natural Language Understanding by Optimizing Diversity
inferred← citeshttps://doi.org/10.1109/asru46091.2019.9004019openalex-snapshot
Zero-Shot Pronunciation Lexicons for Cross-Language Acoustic Model Transfer
inferred← citeshttps://doi.org/10.1109/asru57964.2023.10389721openalex-snapshot
Domain Adaptation by Data Distribution Matching Via Submodularity For Speech Recognition
inferred← citeshttps://doi.org/10.1109/bigdata52589.2021.9671900openalex-snapshot
Scalable Approaches to Selecting Key Entities in Large Networked Infrastructure Systems
inferred← citeshttps://doi.org/10.1109/ccta41146.2020.9206322openalex-snapshot
Coupled Temporal and Spatial Environment Monitoring for Multi-Agent Teams in Precision Farming
inferred← citeshttps://doi.org/10.1109/cdc.2016.7798669openalex-snapshot
Near-optimal sensor scheduling for batch state estimation: Complexity, algorithms, and limits
inferred← citeshttps://doi.org/10.1109/cdc.2017.8264080openalex-snapshot
Impact of information in greedy submodular maximization
inferred← citeshttps://doi.org/10.1109/cec48606.2020.9185878openalex-snapshot
Lazy Greedy Hypervolume Subset Selection from Large Candidate Solution Sets
inferred← citeshttps://doi.org/10.1109/cipae66821.2025.00132openalex-snapshot
Research on Code Allocation Issue Through Efficient PCI Planning Model and Algorithm
inferred← citeshttps://doi.org/10.1109/cluster.2019.8890991openalex-snapshot
Fast and Scalable Implementations of Influence Maximization Algorithms
inferred← citeshttps://doi.org/10.1109/cnsm.2014.7014163openalex-snapshot
Scheduled sampling for robust sensing
inferred← citeshttps://doi.org/10.1109/comsnets.2010.5432011openalex-snapshot
Coordinated sampling sans Origin-Destination identifiers: Algorithms and analysis
inferred← citeshttps://doi.org/10.1109/cvpr.2015.7298928openalex-snapshot
Video summarization by learning submodular mixtures of objectives
inferred← citeshttps://doi.org/10.1109/cvprw.2016.165openalex-snapshot
Spatially Aware Dictionary Learning and Coding for Fossil Pollen Identification
inferred← citeshttps://doi.org/10.1109/ecc.2015.7330605openalex-snapshot
Topology design for optimal network coherence
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/ic-nidc54101.2021.9660543openalex-snapshot
Enhancing Recommendation Diversity Using Determinantal Point Process Forward Inference and Backward Elimination
inferred← citeshttps://doi.org/10.1109/icassp.2013.6639057openalex-snapshot
Submodular feature selection for high-dimensional acoustic score spaces
inferred← citeshttps://doi.org/10.1109/icassp.2014.6854213openalex-snapshot
Submodular subset selection for large-scale speech training data
inferred← citeshttps://doi.org/10.1109/icassp.2014.6854374openalex-snapshot
Unsupervised submodular subset selection for speech data
inferred← citeshttps://doi.org/10.1109/icassp.2017.7952792openalex-snapshot
Multiple wavelength sensing array design
inferred← citeshttps://doi.org/10.1109/icassp49357.2023.10097137openalex-snapshot
Clustered Greedy Algorithm For Large-Scale Sensor Selection
inferred← citeshttps://doi.org/10.1109/iccnc.2019.8685510openalex-snapshot
Optimizing Beams and Bits: A Novel Approach for Massive MIMO Base-Station Design
inferred← citeshttps://doi.org/10.1109/iccps.2018.00016openalex-snapshot
Impact Driven Sensor Placement for Leak Detection in Community Water Networks
inferred← citeshttps://doi.org/10.1109/iccv48922.2021.01011openalex-snapshot
ACAV100M: Automatic Curation of Large-Scale Datasets for Audio-Visual Video Representation Learning
inferred← citeshttps://doi.org/10.1109/icde.2019.00102openalex-snapshot
Tracking Influential Nodes in Time-Decaying Dynamic Interaction Networks
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00072openalex-snapshot
Continuously Tracking Core Items in Data Streams with Probabilistic Decays
inferred← citeshttps://doi.org/10.1109/icdm.2015.59openalex-snapshot
Controlling Propagation at Group Scale on Networks
inferred← citeshttps://doi.org/10.1109/icdmw.2019.00103openalex-snapshot
Efficient Attribute Reduction with Submodular Function Optimization
inferred← citeshttps://doi.org/10.1109/icicsp66564.2025.11338336openalex-snapshot
Randomized Greedy Sampling for Inverse Problems with Tensors
inferred← citeshttps://doi.org/10.1109/icip.2019.8803674openalex-snapshot
Efficient Person Re-Identification in Videos Using Sequence Lazy Greedy Determinantal Point Process (SLGDPP)
inferred← citeshttps://doi.org/10.1109/icnp.2017.8117553openalex-snapshot
Reflection: Automated test location selection for cellular network upgrades
inferred← citeshttps://doi.org/10.1109/icra.2013.6630818openalex-snapshot
Efficient touch based localization through submodularity
inferred← citeshttps://doi.org/10.1109/icra48506.2021.9561226openalex-snapshot
Volumetric Objectives for Multi-Robot Exploration of Three-Dimensional Environments
inferred← citeshttps://doi.org/10.1109/icra48506.2021.9561354openalex-snapshot
Non-Monotone Energy-Aware Information Gathering for Heterogeneous Robot Teams
inferred← citeshttps://doi.org/10.1109/icrcicn.2018.8718693openalex-snapshot
Most Influential Node Selection in Social Network using Genetic Algorithm
inferred← citeshttps://doi.org/10.1109/icst69053.2026.00079openalex-snapshot
FALCON: Efficient Test Case Prioritization via Submodular Optimization
inferred← citeshttps://doi.org/10.1109/icuas.2019.8798293openalex-snapshot
Efficient Decentralized Task Allocation for UAV Swarms in Multi-target Surveillance Missions
inferred← citeshttps://doi.org/10.1109/ieeeconf49454.2021.9382781openalex-snapshot
Active Exploration for Unsupervised Object Categorization Based on Multimodal Hierarchical Dirichlet Process
inferred← citeshttps://doi.org/10.1109/ieeeconf59524.2023.10476958openalex-snapshot
High Probability Guarantees for Submodular Maximization via Boosted Stochastic Greedy
inferred← citeshttps://doi.org/10.1109/infcom.2010.5461937openalex-snapshot
Maximizing the Contact Opportunity for Vehicular Internet Access
inferred← citeshttps://doi.org/10.1109/infocom.2016.7524377openalex-snapshot
Cost-aware Targeted Viral Marketing in billion-scale networks
inferred← citeshttps://doi.org/10.1109/infocom53939.2023.10229029openalex-snapshot
Heterogeneity-Aware Federated Learning with Adaptive Client Selection and Gradient Compression
inferred← citeshttps://doi.org/10.1109/jstsp.2011.2161862openalex-snapshot
Greedy Dictionary Selection for Sparse Representation
inferred← citeshttps://doi.org/10.1109/lcsys.2026.3704520openalex-snapshot
Adaptive Threshold-Driven Continuous Greedy Method for Scalable Submodular Optimization
inferred← citeshttps://doi.org/10.1109/ojcsys.2025.3598626openalex-snapshot
Generalized Concentration-Based Performance Guarantees on Sensor Selection for State Estimation
inferred← citeshttps://doi.org/10.1109/pesgm40551.2019.8973775openalex-snapshot
Submodular Load Clustering with Robust Principal Component Analysis
inferred← citeshttps://doi.org/10.1109/smartgridcomm.2016.7778758openalex-snapshot
Submodular optimization for control of prosumer networks
inferred← citeshttps://doi.org/10.1109/smc.2019.8913989openalex-snapshot
An Efficient Branch-and-Cut Algorithm for Approximately Submodular Function Maximization
inferred← citeshttps://doi.org/10.1109/tcbb.2018.2822280openalex-snapshot
Submodular Generalized Matching for Peptide Identification in Tandem Mass Spectrometry
inferred← citeshttps://doi.org/10.1109/tcns.2015.2444031openalex-snapshot
Minimal Actuator Placement With Bounds on Control Effort
inferred← citeshttps://doi.org/10.1109/tcns.2015.2453711openalex-snapshot
On Submodularity and Controllability in Complex Dynamical Networks
inferred← citeshttps://doi.org/10.1109/tcns.2018.2889005openalex-snapshot
The Impact of Information in Distributed Submodular Maximization
inferred← citeshttps://doi.org/10.1109/tcns.2022.3203806openalex-snapshot
Optimizing Timely Coverage in Communication-Constrained Collaborative Sensing Systems
inferred← citeshttps://doi.org/10.1109/tcomm.2020.3042461openalex-snapshot
Incentive-Based D2D Relaying in Cellular Networks
inferred← citeshttps://doi.org/10.1109/tcss.2020.2998777openalex-snapshot
Scalable Lattice Influence Maximization
inferred← citeshttps://doi.org/10.1109/tcss.2021.3079206openalex-snapshot
Two-Phase Multidocument Summarization Through Content-Attention-Based Subtopic Detection
inferred← citeshttps://doi.org/10.1109/tevc.2017.2749263openalex-snapshot
Constrained Monotone $k$ -Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee
inferred← citeshttps://doi.org/10.1109/tevc.2020.3013290openalex-snapshot
A Survey on the Hypervolume Indicator in Evolutionary Multiobjective Optimization
inferred← citeshttps://doi.org/10.1109/tevc.2021.3103386openalex-snapshot
Fast Greedy Subset Selection From Large Candidate Solution Sets in Evolutionary Multiobjective Optimization
inferred← citeshttps://doi.org/10.1109/tevc.2023.3261134openalex-snapshot
Subset Selection for Evolutionary Multiobjective Optimization
inferred← citeshttps://doi.org/10.1109/tevc.2024.3431928openalex-snapshot
Targeted Pareto Optimization for Subset Selection With Monotone Objective Function and Cardinality Constraint
inferred← citeshttps://doi.org/10.1109/tip.2017.2695887openalex-snapshot
A General Framework for Edited Video and Raw Video Summarization
inferred← citeshttps://doi.org/10.1109/tit.2014.2311802openalex-snapshot
Dynamic Network Delay Cartography
inferred← citeshttps://doi.org/10.1109/tit.2018.2873795openalex-snapshot
Sensor Array Design Through Submodular Optimization
inferred← citeshttps://doi.org/10.1109/tits.2020.2990694openalex-snapshot
Efficient Deployment of Electric Vehicle Charging Infrastructure: Simultaneous Optimization of Charging Station Placement and Charging Pile Assignment
inferred← citeshttps://doi.org/10.1109/tkde.2016.2605088openalex-snapshot
Near-Optimal Algorithms for Controlling Propagation at Group Scale on Networks
inferred← citeshttps://doi.org/10.1109/tkde.2019.2897307openalex-snapshot
ASCENT: Active Supervision for Semi-Supervised Learning
inferred← citeshttps://doi.org/10.1109/tkde.2021.3071081openalex-snapshot
On the Robustness of Diffusion in a Network Under Node Attacks
inferred← citeshttps://doi.org/10.1109/tkde.2023.3328596openalex-snapshot
Hybrid Regret Minimization: A Submodular Approach
inferred← citeshttps://doi.org/10.1109/tkde.2024.3515875openalex-snapshot
Heavy Nodes in a Small Neighborhood: Exact and Peeling Algorithms With Applications
inferred← citeshttps://doi.org/10.1109/tmc.2023.3309497openalex-snapshot
Federated Learning With Client Selection and Gradient Compression in Heterogeneous Edge Systems
inferred← citeshttps://doi.org/10.1109/tnet.2013.2290714openalex-snapshot
Cost-Effective Viral Marketing for Time-Critical Campaigns in Large-Scale Social Networks
inferred← citeshttps://doi.org/10.1109/tnet.2014.2309991openalex-snapshot
Ensuring Predictable Contact Opportunity for Scalable Vehicular Internet Access on the Go
inferred← citeshttps://doi.org/10.1109/tnet.2017.2691544openalex-snapshot
A Billion-Scale Approximation Algorithm for Maximizing Benefit in Viral Marketing
inferred← citeshttps://doi.org/10.1109/tnet.2023.3323028openalex-snapshot
Tracking Influencers in Decaying Social Activity Streams With Theoretical Guarantees
inferred← citeshttps://doi.org/10.1109/ton.2025.3547984openalex-snapshot
PairingFL: Efficient Federated Learning With Model Splitting and Client Pairing
inferred← citeshttps://doi.org/10.1109/tro.2020.2964138openalex-snapshot
Good Feature Matching: Toward Accurate, Robust VO/VSLAM With Low Latency
inferred← citeshttps://doi.org/10.1109/tro.2021.3078333openalex-snapshot
Anchor Selection for SLAM Based on Graph Topology and Submodular Optimization
inferred← citeshttps://doi.org/10.1109/tro.2023.3257512openalex-snapshot
Energy-Aware, Collision-Free Information Gathering for Heterogeneous Robot Teams
inferred← citeshttps://doi.org/10.1109/tsp.2018.2863654openalex-snapshot
A Simple and Effective Approach for Transmit Antenna Selection in Multiuser Massive MIMO Leveraging Submodularity
inferred← citeshttps://doi.org/10.1109/tsp.2021.3125147openalex-snapshot
Information-Theoretic Feature Selection via Tensor Decomposition and Submodularity
inferred← citeshttps://doi.org/10.1109/tsp.2022.3195089openalex-snapshot
On the Benefits of Progressively Increasing Sampling Sizes in Stochastic Greedy Weak Submodular Maximization
inferred← citeshttps://doi.org/10.1109/tsp.2024.3492165openalex-snapshot
Localized Distributional Robustness in Submodular Multi-Task Subset Selection
inferred← citeshttps://doi.org/10.1109/tsp.2026.3671460openalex-snapshot
Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization
inferred← citeshttps://doi.org/10.1109/tvt.2025.3613346openalex-snapshot
Sensor Pairing Optimization and Analytical Solution for Distributed TDOA Localization
inferred← citeshttps://doi.org/10.1109/twc.2013.072513.120734openalex-snapshot
Multi-User MIMO Scheduling in the Fourth Generation Cellular Uplink
inferred← citeshttps://doi.org/10.1109/wacv.2019.00054openalex-snapshot
Demystifying Multi-Faceted Video Summarization: Tradeoff Between Diversity, Representation, Coverage and Importance
inferred← citeshttps://doi.org/10.1109/wacv.2019.00142openalex-snapshot
Learning From Less Data: A Unified Data Subset Selection and Active Learning Framework for Computer Vision
inferred← citeshttps://doi.org/10.1109/wcnc.2014.6952690openalex-snapshot
Energy-aware enterprise femtocell deployment
inferred← citeshttps://doi.org/10.1109/wons.2017.7888765openalex-snapshot
Novel combinatorial results on downlink MU-MIMO scheduling with applications
inferred← citeshttps://doi.org/10.1111/exsy.13156openalex-snapshot
Classify nodes based on their degree distribution: A more scalable method for influence maximization
inferred← citeshttps://doi.org/10.1137/0910022openalex-snapshot
An Accelerated Sequential Algorithm for Producing D -Optimal Designs
inferred← citeshttps://doi.org/10.1137/1.9781611975055.18openalex-snapshot
Scaling up Group Closeness Maximization
inferred← citeshttps://doi.org/10.1137/1.9781611975215.10openalex-snapshot
New Approximation Algorithms for Minimum Weighted Edge Cover
inferred← citeshttps://doi.org/10.1137/1.9781611975673.45openalex-snapshot
Auto-Summarization: A Step Towards Unsupervised Learning of a Submodular Mixture
inferred← citeshttps://doi.org/10.1137/1.9781611976007.5openalex-snapshot
Group Centrality Maximization for Large-scale Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611976700.48openalex-snapshot
Submodular Maximization via Taylor Series Approximation
inferred← citeshttps://doi.org/10.1137/1.9781611976830.5openalex-snapshot
A Parallel Approximation Algorithm for Maximizing Submodular b-Matching
showing the first 200 of 360 · page through all 360
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.