No article text was recorded for this version.
sequential selection bottleneck
Version 1 of 176 papers82 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A New Framework for Distributed Submodular Maximization
- Blog: Fast Parallel Algorithms for Statistical Subset Selection Problems
- Blog: Fairly Allocating Goods in Parallel
- Blog: Parallel Double Greedy Submodular Maximization
- Blog: Design and Implementation of GPU-Based Prim's Algorithm
- Blog: An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation
- Blog: On Maximization of Weakly Modular Functions: Guarantees of Multi-stage Algorithms, Tractability, and Hardness
- Blog: Simple and sharp analysis of k-means||
- Blog: GPU-FAST-PROCLUS: A Fast GPU-parallelized Approach to Projected Clustering
- Blog: How good is the Shapley value-based approach to the influence maximization problem?
- Blog: Distributed Submodular Cover: Succinctly Summarizing Massive Data
- Blog: Discovering Valuable items from Massive Data
- Blog: Enhancing Lossy Compression Through Cross-Field Information for Scientific Applications
- Blog: Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity
- Blog: Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time
- Blog: Training Greedy Policy for Proposal Batch Selection in Expensive Multi-Objective Combinatorial Optimization
- Blog: Weighted Sums of Random Kitchen Sinks: Replacing minimization with randomization in learning
- Blog: Enhancing Performance of Explainable AI Models with Constrained Concept Refinement
- Blog: Scaling Submodular Maximization via Pruned Submodularity Graphs
- Blog: Scalable parallel OPTICS data clustering using graph algorithmic techniques
- Blog: DASH: Distributed Adaptive Sequencing Heuristic for Submodular Maximization
- Blog: An order-aware dataflow model for parallel Unix pipelines
- Blog: Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
- Blog: A Parallel Approximation Algorithm for Maximizing Submodular b-Matching
- Blog: Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
- Blog: Distributed Weighted Matching via Randomized Composable Coresets
- Blog: Large-Scale Stochastic Learning Using GPUs
- Blog: Batch greedy maximization of non-submodular functions: Guarantees and applications to experimental design
- Blog: Submodular Maximization with Optimal Approximation, Adaptivity and Query Complexity
- Blog: Quality-Weighted Vendi Scores And Their Application To Diverse Experimental Design
- Blog: TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
- Blog: Approximation Guarantees for Adaptive Sampling
- Blog: Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
- Blog: Stochastic Submodular Maximization: The Case of Coverage Functions
- Blog: PQNTRU: Acceleration of NTRU-based Schemes via Customized Post-Quantum Processor
- Blog: Streaming PTAS for Constrained k-Means
- Blog: Practical Parallel Algorithms for Submodular Maximization Subject to a Knapsack Constraint with Nearly Optimal Adaptivity
- Blog: Distributed Submodular Maximization: Identifying Representative Elements in Massive Data
- Blog: Teaching Machines to Extract Main Content for Machine Reading Comprehension
- Blog: Fast Feature Selection with Fairness Constraints
- Blog: Fast Distributed Submodular Cover: Public-Private Data Summarization
- Blog: Exploiting multi–core and many–core parallelism for subspace clustering
- Blog: CUDASW++2.0: enhanced Smith-Waterman protein database search on CUDA-enabled GPUs based on SIMT and virtualized SIMD abstractions
- Blog: Parallel Algebraic Effect Handlers
- Blog: Partitioned Gradient Matching-based Data Subset Selection for Compute-Efficient Robust ASR Training
- Blog: Parallel Algorithm for Non-Monotone DR-Submodular Maximization
- Blog: Submodular Function Maximization in Parallel via the Multilinear Relaxation
- Blog: Parallel and Efficient Hierarchical k-Median Clustering
- Blog: Point Cloud Instance Segmentation Using Probabilistic Embeddings
- Blog: Multi-objective evolutionary algorithms are generally good: Maximizing monotone submodular functions over sequences
- Blog: A General SIMD-Based Approach to Accelerating Compression Algorithms
- Blog: Distributed Submodular Maximization
- Blog: Listwise Reward Estimation for Offline Preference-based Reinforcement Learning
- Blog: Parallelizing State Space Plans Online
- Blog: Approximating a Motorcycle Graph by a Straight Skeleton
- Blog: Numerical algebraic geometry: a new perspective on gauge and string theories
- Blog: The Adaptive Complexity of Maximizing a Gross Substitutes Valuation
- Blog: Greedy and Local Ratio Algorithms in the MapReduce Model
- Blog: Breaking Barriers: Combinatorial Algorithms for Non-Monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation
- Blog: The FAST Algorithm for Submodular Maximization
Showing 60 of 76 papers.
History & citation
Current · Permanent link
- This direction split from Parallelizing Greedy Optimization via Low Adaptivity (64% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_sequential_selection_bottleneck_158ff68e,
title = {sequential selection bottleneck},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sequential-selection-bottleneck/rdr_158ff68e69c04f7c91d1c4fc2acf7027},
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_sequential_selection_bottleneck_158ff68e_v1,
title = {sequential selection bottleneck},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sequential-selection-bottleneck/rdr_158ff68e69c04f7c91d1c4fc2acf7027/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}