"A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs ..."

Mohammad R. Salavatipour (2004)

> Home

Details and statistics

DOI: 10.1002/RSA.20016

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/Salavatipour04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/Salavatipour04
Mohammad R. Salavatipour:
A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova'sz Local Lemma. Random Struct. Algorithms 25(1): 68-90 (2004)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.