Hypergraph representation via axis-aligned point-subspace cover
From MaRDI portal
Publication:2154113
DOI10.1007/978-3-030-96731-4_27OpenAlexW3215330440MaRDI QIDQ2154113FDOQ2154113
Authors: Oksana Firman, Joachim Spoerhase 
Publication date: 13 July 2022
Full work available at URL: https://arxiv.org/abs/2111.13555
Cites Work
- A Greedy Heuristic for the Set-Covering Problem
- Topics in Intersection Graph Theory
- Almost optimal set covers in finite VC-dimension
- Weighted geometric set cover via quasi-uniform sampling
- Title not available (Why is that?)
- Self-dual configurations and regular graphs
- On the complexity of approximating \(k\)-set packing
- Point Line Cover: The Easy Kernel is Essentially Tight
- Approximation algorithms for hitting objects with straight lines
- Title not available (Why is that?)
- Combinatorial Pattern Matching
- On a theorem of Lovász on covers in \(r\)-partite hypergraphs
- On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
- Representing graphs and hypergraphs by touching polygons in 3D
- Drawing Graphs on Few Lines and Few Planes
Cited In (1)
This page was built for publication: Hypergraph representation via axis-aligned point-subspace cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154113)
