scientific article; zbMATH DE number 2079358

MaRDI QIDQ4471317zbMATH OpenFDO

Authors Mohammad Salavatipour

Publication date 28 July 2004

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma
• Approximate hypergraph partitioning and applications
• Approximation techniques for hypergraph partitioning problems
• A class of bounded approximation algorithms for graph partitioning
• Approximation Algorithms for Some Graph Partitioning Problems
• An approximation result for matchings in partitioned hypergraphs
• An efficient algorithm for judicious partition of hypergraphs
• scientific article; zbMATH DE number 4011955
• scientific article; zbMATH DE number 1305457
• New algorithmic aspects of the local lemma with applications to routing and partitioning

Cited in

(5)

• New algorithmic aspects of the local lemma with applications to routing and partitioning
• An algorithmic approach to the Lovász local lemma. I
• scientific article; zbMATH DE number 1305457 (Why is no real title available?)
• A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma
• scientific article; zbMATH DE number 1445282 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471317)