"Nearly tight approximation bounds for vertex cover on dense k-uniform ..."

Marek Karpinski, Richard Schmied, Claus Viehmann (2015)

> Home

Details and statistics

DOI: 10.1016/J.JDA.2014.12.010

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jda/KarpinskiSV15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/KarpinskiSV15
Marek Karpinski, Richard Schmied, Claus Viehmann:
Nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs. J. Discrete Algorithms 33: 49-57 (2015)

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.