:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Burkhardt, Paul, Harris, David G., Schmitt, Kevin T
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Artificial Intelligence
Acceso en línea:	https://arxiv.org/abs/2601.10511
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Engineering an Efficient Approximate DNF-Counter
por: Soos, Mate, et al.
Publicado: (2024)

Simple and efficient four-cycle counting on sparse graphs
por: Burkhardt, Paul, et al.
Publicado: (2023)

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
por: Harris, Blake, et al.
Publicado: (2024)

Variance Computation for Weighted Model Counting with Knowledge Compilation Approach
por: Nakamura, Kengo, et al.
Publicado: (2026)

Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity
por: Pham, Canh V.
Publicado: (2024)

Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
por: la Tour, Max Dupré, et al.
Publicado: (2024)

A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the same Skeleton
por: Sharma, Vidya Sagar
Publicado: (2023)

Near-Optimal Parallel Approximate Counting via Sampling
por: Harris, David G., et al.
Publicado: (2026)

Approximating Optimal Labelings for Temporal Connectivity
por: Carnevale, Daniele, et al.
Publicado: (2025)

DNF Learning via Locally Mixing Random Walks
por: Alman, Josh, et al.
Publicado: (2025)

Fast Approximation Algorithm for Non-Monotone DR-submodular Maximization under Size Constraint
por: Tran, Tan D., et al.
Publicado: (2025)

The Model Counting Competition 2020
por: Fichte, Johannes K., et al.
Publicado: (2020)

Approximate Lifted Model Construction
por: Luttermann, Malte, et al.
Publicado: (2025)

Online Algorithms with Unreliable Guidance
por: Dallot, Julien, et al.
Publicado: (2026)

The Model Counting Competitions 2021-2023
por: Fichte, Johannes K., et al.
Publicado: (2025)

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
por: Almansoori, Mahmood K. M., et al.
Publicado: (2025)

Individual Fairness under Varied Notions of Group Fairness in Bipartite Matching - One Framework to Approximate Them All
por: Panda, Atasi, et al.
Publicado: (2022)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
por: Nguyen, Hue T., et al.
Publicado: (2025)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
por: Ganian, Robert, et al.
Publicado: (2025)

A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem
por: Luo, Chunyu, et al.
Publicado: (2024)

Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
por: Fioravantes, Foivos, et al.
Publicado: (2025)

Scalable Algorithms for Individual Preference Stable Clustering
por: Mosenzon, Ron, et al.
Publicado: (2024)

Are Graph Neural Networks Optimal Approximation Algorithms?
por: Yau, Morris, et al.
Publicado: (2023)

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
por: Wang, Long, et al.
Publicado: (2025)

DNF formulas are efficiently testable with relative error
por: Chen, Xi, et al.
Publicado: (2026)

Diversity-aware clustering: Computational Complexity and Approximation Algorithms
por: Thejaswi, Suhas, et al.
Publicado: (2024)

Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication
por: Harris, David G.
Publicado: (2021)

Parallel Sampling via Counting
por: Anari, Nima, et al.
Publicado: (2024)

An Algorithm for Learning Smaller Representations of Models With Scarce Data
por: de Wynter, Adrian
Publicado: (2020)

Streaming Attention Approximation via Discrepancy Theory
por: Kochetkova, Ekaterina, et al.
Publicado: (2025)

Polynomial-Time Approximability of Constrained Reinforcement Learning
por: McMahan, Jeremy
Publicado: (2025)

Enumerating models of DNF faster: breaking the dependency on the formula size
por: Capelli, Florent, et al.
Publicado: (2018)

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
por: Bandyapadhyay, Sayan, et al.
Publicado: (2024)

Identification for Tree-shaped Structural Causal Models in Polynomial Time
por: Gupta, Aaryan, et al.
Publicado: (2023)

Fast EXP3 Algorithms
por: Sato, Ryoma, et al.
Publicado: (2025)

Algorithmically Establishing Trust in Evaluators
por: de Wynter, Adrian
Publicado: (2025)

On Tradeoffs in Learning-Augmented Algorithms
por: Benomar, Ziyad, et al.
Publicado: (2025)

Multi-dimensional Approximate Counting
por: Wang, Dingyu
Publicado: (2024)

Fast Approximate Counting of Cycles
por: Censor-Hillel, Keren, et al.
Publicado: (2024)

An Extended Symbolic-Arithmetic Model for Teaching Double-Black Removal with Rotation in Red-Black Trees
por: Ehimwenma, Kennedy E., et al.
Publicado: (2025)