Image de couverture de livre

Building a Nest by an Automaton

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Czyzowicz, Jurek, Dereniowski, Dariusz, Pelc, Andrzej
Format:	Preprint
Publié:	2019
Sujets:	Data Structures and Algorithms 68W40, 68W27
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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

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

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

On the Advice Complexity of Online Unit Clustering
par: Nagy-György, Judit
Publié: (2023)

Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors
par: Gribelyuk, Elena, et autres
Publié: (2024)

Efficient Processing of Subsequent Densest Subgraph Query
par: Hung, Chia-Yang, et autres
Publié: (2024)

Residual Prophet Inequalities
par: Correa, Jose, et autres
Publié: (2025)

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

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

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

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

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

A $5$-Approximation Analysis for the Cover Small Cuts Problem
par: Simmons, Miles, et autres
Publié: (2026)

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

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
par: Bansal, Ishan, et autres
Publié: (2024)

Searching in trees with monotonic query times
par: Dereniowski, Dariusz, et autres
Publié: (2024)

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

Strongly Sublinear Algorithms for Testing Pattern Freeness
par: Newman, Ilan, et autres
Publié: (2021)

Online Trading as a Secretary Problem Variant
par: Chen, Xujin, et autres
Publié: (2026)

Optimal Online Bipartite Matching in Degree-2 Graphs
par: Bhangale, Amey, et autres
Publié: (2025)

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

The Power of Filling in Balanced Allocations
par: Los, Dimitrios, et autres
Publié: (2022)

Mean-Biased Processes for Balanced Allocations
par: Los, Dimitrios, et autres
Publié: (2023)

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

Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence
par: AmaniHamedani, Alireza, et autres
Publié: (2024)

On Distributed Colouring of Hyperbolic Random Graphs
par: Maus, Yannic, et autres
Publié: (2025)

Using Single-Neuron Representations for Hierarchical Concepts as Abstractions of Multi-Neuron Representations
par: Lynch, Nancy
Publié: (2024)

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

satsuma: Structure-based Symmetry Breaking in SAT
par: Anders, Markus, et autres
Publié: (2024)

Algorithms Transcending the SAT-Symmetry Interface
par: Anders, Markus, et autres
Publié: (2023)

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)

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors
par: Coşa, Matei Gabriel, et autres
Publié: (2025)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
par: Liu, Bowen
Publié: (2025)

Extending Exact Integrality Gap Computations for the Metric TSP
par: Cook, William, et autres
Publié: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
par: Heimann, Sophia, et autres
Publié: (2026)

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

Optimizing Exact String Matching via Statistical Anchoring
par: Garraoui, Omar
Publié: (2025)

Fairness in the k-Server Problem
par: Daneshvaramoli, Mohammadreza, et autres
Publié: (2025)