Image de couverture de livre

Strongly Sublinear Algorithms for Testing Pattern Freeness

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Newman, Ilan, Varma, Nithin
Format:	Preprint
Publié:	2021
Sujets:	Data Structures and Algorithms 68W20, 68W25 F.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
par: Chen, Zongchen, et autres
Publié: (2022)

Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$"
par: Gupta, Swati, et autres
Publié: (2022)

Provably Small Portfolios for Multiobjective Optimization with Application to Subsidized Facility Location
par: Gupta, Swati, et autres
Publié: (2025)

Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees
par: Gupta, Swati, et autres
Publié: (2023)

Stochastic Function Certification with Correlations
par: Ghuge, Rohan, et autres
Publié: (2026)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
par: DasGupta, Bhaskar, et autres
Publié: (2026)

Shortest Paths without a Map, but with an Entropic Regularizer
par: Bubeck, Sébastien, et autres
Publié: (2022)

Random-Order Online Independent Set of Intervals and Hyperrectangles
par: Garg, Mohit, et autres
Publié: (2024)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
par: Friggstad, Zachary, et autres
Publié: (2018)

Quasi-optimal hierarchically semi-separable matrix approximation
par: Amsel, Noah, et autres
Publié: (2025)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
par: Hougardy, Stefan, et autres
Publié: (2025)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
par: Gu, Qian-Ping, et autres
Publié: (2025)

How to Compute a Moving Sum
par: Maslen, David K., et autres
Publié: (2025)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
par: An, Hyung-Chan, et autres
Publié: (2025)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
par: Filmus, Yuval, et autres
Publié: (2024)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
par: Sopp, Braeden, et autres
Publié: (2026)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
par: Borodin, Allan, et autres
Publié: (2025)

PPSZ is better than you think
par: Scheder, Dominik
Publié: (2022)

Naively Sorting Evolving Data is Optimal and Robust
par: Giakkoupis, George, et autres
Publié: (2024)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
par: Zhong, Xianghui
Publié: (2019)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
par: Grobben, Kobe, et autres
Publié: (2025)

The Telephone $k$-Multicast Problem
par: Hathcock, Daniel, et autres
Publié: (2024)

Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities
par: Bai, Miao, et autres
Publié: (2023)

A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem
par: Simmons, Miles, et autres
Publié: (2025)

Improved Approximation Algorithms for the Expanding Search Problem
par: Griesbach, Svenja M., et autres
Publié: (2023)

Optimal non-adaptive algorithm for edge estimation
par: Bishnu, Arijit, et autres
Publié: (2025)

Incremental-Decremental Maximization
par: Disser, Yann, et autres
Publié: (2025)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
par: Feldman, Moran, et autres
Publié: (2026)

Many Objective Problems Where Crossover is Provably Essential
par: Opris, Andre
Publié: (2024)

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
par: Sun, Hao
Publié: (2023)

Fast FPT Algorithms for Grundy Number on Dense Graphs
par: Nezhad, Sina Ghasemi, et autres
Publié: (2024)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
par: Crochemore, Maxime, et autres
Publié: (2025)

Strengths and Limitations of Greedy in Cup Games
par: Jasińska, Kalina, et autres
Publié: (2026)

Improved Randomized Approximation of Hard Universality and Emptiness Problems
par: Andreou, Pantelis, et autres
Publié: (2024)

Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
par: Shigemizu, Mika, et autres
Publié: (2018)

Building a Nest by an Automaton
par: Czyzowicz, Jurek, et autres
Publié: (2019)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
par: Hommelsheim, Felix
Publié: (2025)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
par: Buchbinder, Niv, et autres
Publié: (2024)

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
par: Feng, Weiming, et autres
Publié: (2022)

The Bottom-Left Algorithm for the Strip Packing Problem
par: Hougardy, Stefan, et autres
Publié: (2024)