Imagen de Portada

On the Advice Complexity of Online Unit Clustering

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Nagy-György, Judit
Formato:	Preprint
Publicado:	2023
Materias:	Data Structures and Algorithms 68W27
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Building a Nest by an Automaton
por: Czyzowicz, Jurek, et al.
Publicado: (2019)

Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors
por: Gribelyuk, Elena, et al.
Publicado: (2024)

Efficient Processing of Subsequent Densest Subgraph Query
por: Hung, Chia-Yang, et al.
Publicado: (2024)

Random-Order Online Independent Set of Intervals and Hyperrectangles
por: Garg, Mohit, et al.
Publicado: (2024)

On the Advice Complexity of Online Matching on the Line
por: Csaba, Béla, et al.
Publicado: (2024)

Shortest Paths without a Map, but with an Entropic Regularizer
por: Bubeck, Sébastien, et al.
Publicado: (2022)

Optimal Online Bipartite Matching in Degree-2 Graphs
por: Bhangale, Amey, et al.
Publicado: (2025)

A $5$-Approximation Analysis for the Cover Small Cuts Problem
por: Simmons, Miles, et al.
Publicado: (2026)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
por: Borodin, Allan, et al.
Publicado: (2025)

Residual Prophet Inequalities
por: Correa, Jose, et al.
Publicado: (2025)

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
por: Bansal, Ishan, et al.
Publicado: (2024)

Incremental-Decremental Maximization
por: Disser, Yann, et al.
Publicado: (2025)

Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence
por: AmaniHamedani, Alireza, et al.
Publicado: (2024)

Online Trading as a Secretary Problem Variant
por: Chen, Xujin, et al.
Publicado: (2026)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
por: Friggstad, Zachary, et al.
Publicado: (2018)

Fairness in the k-Server Problem
por: Daneshvaramoli, Mohammadreza, et al.
Publicado: (2025)

Streaming algorithms for groups and semigroups
por: Lohrey, Markus, et al.
Publicado: (2022)

Loss Minimization for Electrical Flows over Spanning Trees on Grids
por: Ito, Takehiro, et al.
Publicado: (2024)

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

Algorithms Transcending the SAT-Symmetry Interface
por: Anders, Markus, et al.
Publicado: (2023)

Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities
por: Bai, Miao, et al.
Publicado: (2023)

On Distributed Colouring of Hyperbolic Random Graphs
por: Maus, Yannic, et al.
Publicado: (2025)

Using Single-Neuron Representations for Hierarchical Concepts as Abstractions of Multi-Neuron Representations
por: Lynch, Nancy
Publicado: (2024)

The Telephone $k$-Multicast Problem
por: Hathcock, Daniel, et al.
Publicado: (2024)

satsuma: Structure-based Symmetry Breaking in SAT
por: Anders, Markus, et al.
Publicado: (2024)

A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem
por: Simmons, Miles, et al.
Publicado: (2025)

On the on-line coloring of unit interval graphs with proper interval representation
por: Curbelo, Israel R., et al.
Publicado: (2024)

Strongly Sublinear Algorithms for Testing Pattern Freeness
por: Newman, Ilan, et al.
Publicado: (2021)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
por: Grobben, Kobe, et al.
Publicado: (2025)

How to Compute a Moving Sum
por: Maslen, David K., et al.
Publicado: (2025)

Parameterized Complexity of Directed Traveling Salesman Problem
por: Blažej, Václav, et al.
Publicado: (2025)

Fast Dimensionality Reduction from $\ell_2$ to $\ell_p$
por: Chiclana, Rafael, et al.
Publicado: (2025)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
por: Sopp, Braeden, et al.
Publicado: (2026)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
por: An, Hyung-Chan, et al.
Publicado: (2025)

Improved Approximation Algorithms for the Expanding Search Problem
por: Griesbach, Svenja M., et al.
Publicado: (2023)

Optimizing Exact String Matching via Statistical Anchoring
por: Garraoui, Omar
Publicado: (2025)

Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps
por: Gupta, Swati, et al.
Publicado: (2026)

Online coloring of short interval graphs and two-count interval graphs
por: Curbelo, Israel R.
Publicado: (2024)

A simple Path-based LP Relaxation for Directed Steiner Tree
por: Pashkovich, Kanstantsin, et al.
Publicado: (2026)

Strengths and Limitations of Greedy in Cup Games
por: Jasińska, Kalina, et al.
Publicado: (2026)