No article text was recorded for this version.
greedy approximation guarantees
Version 1 of 11,254 papers1,830 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Edge Deletion Algorithms for Minimizing Spread in SIR Epidemic Models
- Blog: Recommending Links to Control Elections via Social Influence
- Blog: Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning
- Blog: Viral vs. Effective: Utility Based Influence Maximization
- Blog: Leader Selection for Minimizing Convergence Error in Leader-Follower Systems: A Supermodular Optimization Approach
- Blog: Scaling the Indian Buffet Process via Submodular Maximization
- Blog: Exploiting Social Influence to Control Elections Based on Scoring Rules
- Blog: Submodularity in Input Node Selection for Networked Systems
- Blog: Influence Maximization Under the Non-progressive Linear Threshold Model
- Blog: Submodularity of Energy Related Controllability Metrics
- Blog: Feature Cross Search via Submodular Optimization
- Blog: Influence Maximization in the Independent Cascade Model
- Blog: Multiplex Influence Maximization in Online Social Networks with Heterogeneous Diffusion Models
- Blog: Demarcating Endogenous and Exogenous Opinion Dynamics: An Experimental Design Approach
- Blog: Sub-Modularity of Waterfilling with Applications to Online Basestation Allocation
- Blog: On the Structure and Computation of Random Walk Times in Finite Graphs
- Blog: Recommending links through influence maximization
- Blog: On the Submodularity of Influence in Social Networks
- Blog: Near-Optimal Distributed Estimation for a Network of Sensing Units Operating Under Communication Constraints
- Blog: Some Properties of Batch Value of Information in the Selection Problem (Extended Abstract)
- Blog: Combining near-optimal feature selection with gSpan
- Blog: Finding a Collective Set of Items: From Proportional Multirepresentation to Group Recommendation
- Blog: Towards Coreset Learning in Probabilistic Circuits
- Blog: SPOT: A Framework for Selection of Prototypes Using Optimal Transport
- Blog: A Scalable Solution for the Extended Multi-channel Facility Location Problem
- Blog: Learning Interpretable Decision Rule Sets: A Submodular Optimization Approach
- Blog: Learning Interpretable Decision Rule Sets: A Submodular Optimization Approach
- Blog: Recommending links through influence maximization
- Blog: Edge Deletion Algorithms for Minimizing Spread in SIR Epidemic Models
- Blog: Generalized budgeted submodular set function maximization
- Blog: Improving the betweenness centrality of a node by adding links
- Blog: Fast Graph Subset Selection Based on G-optimal Design
- Blog: A Supermodular Optimization Framework for Leader Selection under Link Noise in Linear Multi-Agent Systems
- Blog: Exploiting Structure of Uncertainty for Efficient Combinatorial Semi-Bandits
- Blog: Efficient Modality Selection in Multimodal Learning
- Blog: Seed Selection in the Heterogeneous Moran Process
- Blog: GenDeR: A Generic Diversified Ranking Algorithm
- Blog: Learning to Select Base Classes for Few-shot Classification
- Blog: One-Shot Session Recommendation Systems with Combinatorial Items
- Blog: Greedy Minimization of Weakly Supermodular Set Functions
- Blog: Supermodular Optimization for Redundant Robot Assignment under Travel-Time Uncertainty
- Blog: Gramian-based reachability metrics for bilinear networks
- Blog: Training data selection for acoustic modeling via submodular optimization of joint kullback-leibler divergence
- Blog: Training Data Subset Selection for Regression with Controlled Generalization Error
- Blog: SPOT: A framework for selection of prototypes using optimal transport
- Blog: A Supermodular Optimization Framework for Leader Selection Under Link Noise in Linear Multi-Agent Systems
- Blog: Submodular Inference of Diffusion Networks from Multiple Trees
- Blog: Dynamic batching of online arrivals to leverage economies of scale
- Blog: Invasion Dynamics in the Biased Voter Process
- Blog: Sub-modularity and Antenna Selection in MIMO systems
- Blog: On Submodularity and Controllability in Complex Dynamical Networks
- Blog: Feature Cross Search via Submodular Optimization
- Blog: Efficient and Optimal Algorithms for Tree Summarization with Weighted Terminologies
- Blog: Minimizing Convergence Error in Multi-Agent Systems via Leader Selection: A Supermodular Optimization Approach
- Blog: Submodular spectral functions of principal submatrices of an hermitian matrix
- Blog: Optimal Inverter-Based Resources Placement in Low-Inertia Power Systems
- Blog: A Community-Aware Framework for Social Influence Maximization
- Blog: Choosing panels of genomics assays using submodular optimization
- Blog: On the Structure and Computation of Random Walk Times in Finite Graphs
- Blog: Submodular Dictionary Selection for Sparse Representation
Showing 60 of 1,254 papers.
History & citation
Current · Permanent link
- Submodularity in Network Actuator and Sensor Placement merged into this direction (91% overlap)
- Submodular Subset Selection for Machine Learning merged into this direction (79% overlap)
- Submodular Optimization for Causal Structure and Control merged into this direction (80% overlap)
- Submodular Optimization for Influence Maximization in Networks merged into this direction (84% overlap)
- Supermodular Optimization for Network Design and Control merged into this direction (96% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_greedy_approximation_guarantees_088ecdc4,
title = {greedy approximation guarantees},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/greedy-approximation-guarantees/rdr_088ecdc44353414db7542572c906a57b},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_greedy_approximation_guarantees_088ecdc4_v1,
title = {greedy approximation guarantees},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/greedy-approximation-guarantees/rdr_088ecdc44353414db7542572c906a57b/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}