No article text was recorded for this version.
representative set pruning
Version 1 of 130 papers37 conceptsfrozen 2026-10-04
Papers in this version
- Blog: How to navigate through obstacles?
- Blog: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Blog: Efficient Dominant Point Algorithms for the Multiple Longest Common Subsequence (MLCS) Problem
- Blog: Scheduling Partially Ordered Jobs Faster Than 2 n
- Blog: A Fully Polynomial Time Approximation Scheme for Packing While Traveling
- Blog: Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)
- Blog: Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs - Part I: Algorithmic Results
- Blog: Faster Exact and Approximate Algorithms for k-Cut
- Blog: Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs
- Blog: Fair Short Paths in Vertex-Colored Graphs
- Blog: On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs
- Blog: IDAR: Fast Supergraph Search Using DAG Integration
- Blog: A heuristic algorithm using tree decompositions for the maximum happy vertices problem
- Blog: Faster exponential-time algorithms in graphs of bounded average degree
- Blog: Gelato: Graph Edit Distance via Autoregressive Neural Combinatorial Optimization
- Blog: An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint
- Blog: A technique for obtaining true approximations for k-center with covering constraints
- Blog: Joint Denoising/Compression of Image Contours via Shape Prior and Context Tree
- Blog: Approximate Coalition Structure Generation
- Blog: Scheduling Partially Ordered Jobs Faster than 2 n
- Blog: LinearPartition: linear-time approximation of RNA folding partition function and base-pairing probabilities
- Blog: Probabilistic Size-constrained Microclustering
- Blog: On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems
- Blog: A Tight Subexponential-Time Algorithm for Two-Page Book Embedding
- Blog: The Parameterized Complexity Landscape of the Unsplittable Flow Problem
- Blog: A Graph Theoretic Framework of Recomputation Algorithms for Memory-Efficient Backpropagation
- Blog: A New Relaxation for Tree-Based Problems and Minimum Power-Cost Spanning Trees
- Blog: An Imperfect Algorithm for Coalition Structure Generation
- Blog: Maximizing the number of worker's self-selected tasks in spatial crowdsourcing
- Blog: Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth
History & citation
Current · Permanent link
- This direction split from Representative Sets for Pruning Dynamic Programming (50% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_representative_set_pruning_88f4ca72,
title = {representative set pruning},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/representative-set-pruning/rdr_88f4ca72a5dd4a329ce1fbde948aa67a},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_representative_set_pruning_88f4ca72_v1,
title = {representative set pruning},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/representative-set-pruning/rdr_88f4ca72a5dd4a329ce1fbde948aa67a/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}