"A Polynomial Approximation Algorithm for the Minimum Fill-In Problem."

Assaf Natanzon, Ron Shamir, Roded Sharan (2000)

> Home

Details and statistics

DOI: 10.1137/S0097539798336073

access: closed

type: Journal Article

metadata version: 2020-03-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/NatanzonSS00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/NatanzonSS00
Assaf Natanzon, Ron Shamir, Roded Sharan:
A Polynomial Approximation Algorithm for the Minimum Fill-In Problem. SIAM J. Comput. 30(4): 1067-1079 (2000)

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.