The Algorithmic Aspects of Uncrowded Hypergraphs

DOI10.1137/S0097539797323716zbMath0937.68056OpenAlexW2003529351MaRDI QIDQ4268877

Claudia Bertram-Kretzberg, Hanno Lefmann

Publication date: 28 October 1999

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539797323716

zbMATH Keywords

approximation algorithmindependence number

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (13)

Large triangles in the \(d\)-dimensional unit cube ⋮ On vertex independence number of uniform hypergraphs ⋮ Heilbronn triangle‐type problems in the unit square [0,1²] ⋮ Generalizations of Heilbronn's Triangle Problem ⋮ Distributions of points in the unit square and large \(k\)-gons ⋮ No l Grid-Points in Spaces of Small Dimension ⋮ Access balancing in storage systems by labeling partial Steiner systems ⋮ Exploiting a hypergraph model for finding Golomb rulers ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Distributions of points in \(d\) dimensions and large \(k\) -point simplices ⋮ Point sets in the unit square and large areas of convex hulls of subsets of points ⋮ On sets of points that determine only acute angles ⋮ On the independence number of non-uniform uncrowded hypergraphs

This page was built for publication: The Algorithmic Aspects of Uncrowded Hypergraphs