"Greedy algorithms for max sat and maximum matching: their power and ..."

Matthias Poloczek (2012)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2021-07-17

- view
  authority control:
- export record
  dblp key:
  - phd/dnb/Poloczek12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/dnb/Poloczek12
Matthias Poloczek:
Greedy algorithms for max sat and maximum matching: their power and limitations. Goethe University Frankfurt am Main, 2012, pp. 1-165

a service of

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.