Imagen de Portada

A Near-Optimal Kernel for a Coloring Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Haviv, Ishay, Rabinovich, Dror
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Kernelization for Orthogonality Dimension
por: Haviv, Ishay, et al.
Publicado: (2024)

Kernelization Bounds for Constrained Coloring
por: Haviv, Ishay
Publicado: (2026)

Kernelization for $H$-Coloring
por: Berkman, Yael, et al.
Publicado: (2025)

Kernels for Storage Capacity and Dual Index Coding
por: Haviv, Ishay
Publicado: (2025)

Improved Approximation Algorithms for Index Coding
por: Chawin, Dror, et al.
Publicado: (2024)

Fixed-Parameter Algorithms for the Kneser and Schrijver Problems
por: Haviv, Ishay
Publicado: (2022)

A Fixed-Parameter Algorithm for the Kneser Problem
por: Haviv, Ishay
Publicado: (2022)

Testing Intersectingness of Uniform Families
por: Haviv, Ishay, et al.
Publicado: (2024)

Near-Optimal Sparsifiers for Stochastic Knapsack and Assignment Problems
por: Dughmi, Shaddin, et al.
Publicado: (2025)

Nearly Optimal List Labeling
por: Bender, Michael A., et al.
Publicado: (2024)

Online Edge Coloring is (Nearly) as Easy as Offline
por: Blikstad, Joakim, et al.
Publicado: (2024)

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
por: Harada, Tsubasa, et al.
Publicado: (2024)

Nearly Optimal Internal Dictionary Matching
por: Chen, Jingbang, et al.
Publicado: (2023)

Faster Vizing and Near-Vizing Edge Coloring Algorithms
por: Assadi, Sepehr
Publicado: (2024)

Near-Optimal Property Testers for Pattern Matching
por: Jin, Ce, et al.
Publicado: (2025)

Near-Optimal Directed Low-Diameter Decompositions
por: Bringmann, Karl, et al.
Publicado: (2025)

Nearly Optimal Bounds for Stochastic Online Sorting
por: Hu, Yang
Publicado: (2025)

Near-Optimal Minimum Cuts in Hypergraphs at Scale
por: Chhabra, Adil, et al.
Publicado: (2025)

Transposition is Nearly Optimal for IID List Update
por: Coester, Christian
Publicado: (2026)

Near-Optimal Dimension Reduction for Facility Location
por: Huang, Lingxiao, et al.
Publicado: (2024)

Near-Optimal Heaps and Dijkstra on Pointer Machines
por: van der Hoog, Ivor, et al.
Publicado: (2026)

Near-Optimal Algorithm for Directed Expander Decompositions
por: Sulser, Aurelio L., et al.
Publicado: (2024)

Nearly Optimal Fault Tolerant Distance Oracle
por: Dey, Dipan, et al.
Publicado: (2024)

Nearly Tight Bounds for the Online Sorting Problem
por: Azar, Yossi, et al.
Publicado: (2025)

A Near-Real-Time Reduction-Based Algorithm for Coloring Massive Graphs
por: Zhu, Chenghao, et al.
Publicado: (2025)

A Simple Algorithm for Near-Vizing Edge-Coloring in Near-Linear Time
por: Dhawan, Abhishek
Publicado: (2024)

Deterministic $k$-Median Clustering in Near-Optimal Time
por: Costa, Martín, et al.
Publicado: (2025)

Constant Approximation of Arboricity in Near-Optimal Sublinear Time
por: Dai, Jiangqi, et al.
Publicado: (2025)

Near-Optimal Bayesian Online Assortment of Reusable Resources
por: Feng, Yiding, et al.
Publicado: (2025)

Near-Optimal Fault-Tolerant Strong Connectivity Preservers
por: Hoppenworth, Gary, et al.
Publicado: (2025)

Near Optimal Dual Fault Tolerant Distance Oracle
por: Dey, Dipan, et al.
Publicado: (2024)

Near-Optimal Trace Reconstruction for Mildly Separated Strings
por: Aamand, Anders, et al.
Publicado: (2024)

Near-Optimal Four-Cycle Counting in Graph Streams
por: Lüderssen, Sebastian, et al.
Publicado: (2026)

A (Very) Nearly Optimal Sketch for $k$-Edge Connectivity Certificates
por: Sawettamalya, Pachara, et al.
Publicado: (2025)

Optimal (degree+1)-Coloring in Congested Clique
por: Coy, Sam, et al.
Publicado: (2023)

Near-real-time Solutions for Online String Problems
por: Köppl, Dominik, et al.
Publicado: (2026)

On the Complexity of Distributed Edge Coloring and Orientation Problems
por: Brandt, Sebastian, et al.
Publicado: (2025)

Color Fault-Tolerant Distance Preservers: Õptimal Size in Conditionally Õptimal Time
por: Parter, Merav, et al.
Publicado: (2025)

Deterministic Simple $(Δ+\varepsilonα)$-Edge-Coloring in Near-Linear Time
por: Elkin, Michael, et al.
Publicado: (2024)

Ultra-Resilient Superimposed Codes: Near-Optimal Construction and Applications
por: De Marco, Gianluca, et al.
Publicado: (2025)