Existence of bounded-genus supports for cross-free intersection hypergraphs from connected subgraphs of bounded-genus host graphs, generalizing prior planar results.
A greedy heuristic for the set-covering problem.Math- ematics of operations research, 4(3):233–235, 1979
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Supports for graphs of bounded genus
Existence of bounded-genus supports for cross-free intersection hypergraphs from connected subgraphs of bounded-genus host graphs, generalizing prior planar results.