Imagen de Portada

Testing Intersectingness of Uniform Families

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Haviv, Ishay, Parnas, Michal
Formato:	Preprint
Publicado:	2024
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

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

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

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

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

A Near-Optimal Kernel for a Coloring Problem
por: Haviv, Ishay, et al.
Publicado: (2025)

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

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

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

Protrusion Decompositions Revisited: Uniform Lossy Kernels for Reducing Treewidth and Linear Kernels for Hitting Disconnected Minors
por: Sharma, Roohani, et al.
Publicado: (2026)

Replicable Uniformity Testing
por: Liu, Sihan, et al.
Publicado: (2024)

Average Case Graph Searching in Non-Uniform Cost Models
por: Szyfelbein, Michał
Publicado: (2026)

Instance-Optimal Uniformity Testing and Tracking
por: Blanc, Guy, et al.
Publicado: (2025)

Approximating the Average-Case Graph Search Problem with Non-Uniform Costs
por: Szyfelbein, Michał
Publicado: (2025)

Multi-Pass Streaming Lower Bounds for Uniformity Testing
por: Li, Qian, et al.
Publicado: (2025)

Constant-Factor Approximation for the Uniform Decision Tree
por: Szyfelbein, Michał
Publicado: (2026)

Expander Decomposition for Non-Uniform Vertex Measures
por: Agassy, Daniel, et al.
Publicado: (2025)

Structural Results for High-Multiplicity Scheduling on Uniform Machines
por: Brinkop, Hauke, et al.
Publicado: (2022)

Planar Disjoint Shortest Paths is Fixed-Parameter Tractable
por: Pilipczuk, Michał, et al.
Publicado: (2025)

Approximation Algorithms for Network Design in Non-Uniform Fault Models
por: Chekuri, Chandra, et al.
Publicado: (2024)

Uniform Sampling of Negative Edge Weights in Shortest Path Networks
por: Geis, Lukas, et al.
Publicado: (2024)

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines
por: Rohwedder, Lars
Publicado: (2025)

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
por: Łącki, Jakub, et al.
Publicado: (2025)

Losing Treewidth In The Presence Of Weights
por: Włodarczyk, Michał
Publicado: (2024)

An Optimal Algorithm for Sorting Pattern-Avoiding Sequences
por: Opler, Michal
Publicado: (2024)

Constant Approximating Disjoint Paths on Acyclic Digraphs is W[1]-hard
por: Włodarczyk, Michał
Publicado: (2024)

Designing Compact ILPs via Fast Witness Verification
por: Włodarczyk, Michał
Publicado: (2025)

Going Beyond Surfaces in Diameter Approximation
por: Włodarczyk, Michał
Publicado: (2025)

Min-Sum Set Cover on Parallel Machines
por: Szyfelbein, Michał
Publicado: (2026)

Inapproximability of Counting Permutation Patterns
por: Opler, Michal
Publicado: (2026)

Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth
por: Wlodarczyk, Michal
Publicado: (2023)

Near Uniform Triangle Sampling Over Adjacency List Graph Streams
por: Bishnu, Arijit, et al.
Publicado: (2024)

Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines
por: Heeger, Klaus, et al.
Publicado: (2024)

A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
por: Basiak, Mateusz, et al.
Publicado: (2025)

Almost-Uniform Edge Sampling: Leveraging Independent-Set and Local Graph Queries
por: Adar, Tomer, et al.
Publicado: (2026)

Minmax-Regret $k$-Sink Location on a Dynamic Tree Network with Uniform Capacities
por: Golin, Mordecai J., et al.
Publicado: (2018)

Robust Scheduling on Uniform Machines -- New Results Using a Relaxed Approximation Guarantee
por: Brinkop, Hauke, et al.
Publicado: (2025)

Dynamic Detours
por: Dadush, Daniel, et al.
Publicado: (2026)

Toward Optimal Approximations for Resource-Minimization for Fire Containment on Trees and Non-Uniform k-Center
por: Blauth, Jannis, et al.
Publicado: (2025)

Submodular Maximization Subject to Uniform and Partition Matroids: From Theory to Practical Applications and Distributed Solutions
por: Kia, Solmaz S.
Publicado: (2025)

SquareSort: a cache-oblivious sorting algorithm
por: Koucký, Michal, et al.
Publicado: (2024)