Hypergraph representation via axis-aligned point-subspace cover

DOI10.1007/978-3-030-96731-4_27OpenAlexW3215330440MaRDI QIDQ2154113

Joachim Spoerhase, Oksana Firman

Publication date: 13 July 2022

Full work available at URL: https://arxiv.org/abs/2111.13555

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for hitting objects with straight lines
• Almost optimal set covers in finite VC-dimension
• On a theorem of Lovász on covers in \(r\)-partite hypergraphs
• Representing graphs and hypergraphs by touching polygons in 3D
• On the complexity of approximating \(k\)-set packing
• Weighted geometric set cover via quasi-uniform sampling
• Drawing Graphs on Few Lines and Few Planes
• On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
• A Greedy Heuristic for the Set-Covering Problem
• Topics in Intersection Graph Theory
• Point Line Cover: The Easy Kernel is Essentially Tight
• Combinatorial Pattern Matching
• Self-dual configurations and regular graphs

This page was built for publication: Hypergraph representation via axis-aligned point-subspace cover