Hypergraph representation via axis-aligned point-subspace cover

DOI10.1007/978-3-030-96731-4_27MaRDI QIDQ2154113zbMATH OpenOpenAlexFDO

Authors Oksana Firman, Joachim Spoerhase

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

• scientific article; zbMATH DE number 1670858 (Why is no real title available?)
• A Greedy Heuristic for the Set-Covering Problem
• Almost optimal set covers in finite VC-dimension
• Approximation algorithms for hitting objects with straight lines
• Combinatorial Pattern Matching
• Drawing Graphs on Few Lines and Few Planes
• On a theorem of Lovász on covers in \(r\)-partite hypergraphs
• On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
• On the complexity of approximating \(k\)-set packing
• Point line cover: the easy kernel is essentially tight
• Representing graphs and hypergraphs by touching polygons in 3D
• Self-dual configurations and regular graphs
• Topics in Intersection Graph Theory
• Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
• Weighted geometric set cover via quasi-uniform sampling

Cited in

(1)

• Hypergraph Representation via Axis-Aligned Point-Subspace Cover

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)