Cover Image

Kernelization for Orthogonality Dimension

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Haviv, Ishay, Rabinovich, Dror
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Kernelization Bounds for Constrained Coloring
by: Haviv, Ishay
Published: (2026)

Kernels for Storage Capacity and Dual Index Coding
by: Haviv, Ishay
Published: (2025)

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

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

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

Testing Intersectingness of Uniform Families
by: Haviv, Ishay, et al.
Published: (2024)

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

Boundaried Kernelization
by: Antipov, Leonid, et al.
Published: (2025)

Coresets for Kernel Clustering
by: Jiang, Shaofeng H. -C., et al.
Published: (2021)

Dynamic Meta-Kernelization
by: Bertram, Christian, et al.
Published: (2025)

Faster algorithms for k-Orthogonal Vectors in low dimension
by: Dürr, Anita, et al.
Published: (2025)

Space-Efficient Graph Kernelizations
by: Kammer, Frank, et al.
Published: (2020)

Dynamic Kernel Graph Sparsifiers
by: Cao, Yang, et al.
Published: (2022)

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

Convolution and Knapsack in Higher Dimensions
by: Grage, Kilian, et al.
Published: (2024)

Boundaried Kernelization via Representative Sets
by: Antipov, Leonid, et al.
Published: (2025)

Faster Algorithms for Average-Case Orthogonal Vectors and Closest Pair Problems
by: Alman, Josh, et al.
Published: (2024)

Maximizing the Minimum Eigenvalue in Constant Dimension
by: Brown, Adam, et al.
Published: (2024)

Highway Dimension: a Metric View
by: Feldmann, Andreas Emil, et al.
Published: (2024)

Practical Computation of Graph VC-Dimension
by: Coudert, David, et al.
Published: (2024)

Dimension-Free Correlated Sampling for the Hypersimplex
by: Joseph, et al.
Published: (2025)

Block Coordinate Descent Methods for Optimization under J-Orthogonality Constraints with Applications
by: He, Di, et al.
Published: (2024)

Efficient Kernelization Algorithm for Bipartite Graph Matching
by: Wu, Guang, et al.
Published: (2024)

A Refined Kernel for $d$-Hitting Set
by: Liu, Yuxi, et al.
Published: (2025)

Quadratic Kernel for Cliques or Trees Vertex Deletion
by: Kumabe, Soh
Published: (2025)

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

Moderate Dimension Reduction for $k$-Center Clustering
by: Jiang, Shaofeng H. -C., et al.
Published: (2023)

Improved Kernelization and Fixed-parameter Algorithms for Bicluster Editing
by: Lafond, Manuel
Published: (2024)

Linear Kernels for $l$-Exact Component Order Connectivity
by: Liu, Yuxi, et al.
Published: (2026)

Polynomial Kernels with Reachability for Weighted $d$-Matroid Intersection
by: Huang, Chien-Chung, et al.
Published: (2026)

An Improved Kernel and Parameterized Algorithm for Almost Induced Matching
by: Liu, Yuxi, et al.
Published: (2023)

Tree Embedding in High Dimensions: Dynamic and Massively Parallel
by: Goranci, Gramoz, et al.
Published: (2025)

Dimension Reduction for Clustering: The Curious Case of Discrete Centers
by: Jiang, Shaofeng H. -C., et al.
Published: (2025)

Generalized $k$-Center: Distinguishing Doubling and Highway Dimension
by: Feldmann, Andreas Emil, et al.
Published: (2022)

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
by: Bentert, Matthias, et al.
Published: (2024)

Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion
by: Houari-Durand, Séhane Bel, et al.
Published: (2025)

Dynamic Diameter in High-Dimensions against Adaptive Adversary and Beyond
by: Banihashem, Kiarash, et al.
Published: (2025)

A Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations
by: Charikar, Moses, et al.
Published: (2024)

An Almost Quadratic Vertex Kernel for Subset Feedback Arc Set in Tournaments
by: Bai, Tian
Published: (2025)