Partitioning problems in dense hypergraphs

DOI10.1016/S0166-218X(00)00323-1zbMath0987.05077MaRDI QIDQ5957354

Andrzej Czygrinow

Publication date: 19 June 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

hypergraphpartitioning problemapproximation algorithmdiscrepancy problemSzemerédi's regularity lemma

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quick approximation to matrices and applications
• The uniformity lemma for hypergraphs
• Constructive Quasi-Ramsey Numbers and Tournament Ranking
• The Algorithmic Aspects of the Regularity Lemma
• An Algorithmic Regularity Lemma for Hypergraphs
• A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
• MAX-CUT has a randomized approximation scheme in dense graphs

This page was built for publication: Partitioning problems in dense hypergraphs