"Complexity dichotomies for the MinimumF-Overlay problem."

Nathann Cohen et al. (2018)

> Home

Details and statistics

DOI: 10.1016/J.JDA.2018.11.010

access: closed

type: Journal Article

metadata version: 2019-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jda/CohenHMSW18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/CohenHMSW18
Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity dichotomies for the MinimumF-Overlay problem. J. Discrete Algorithms 52-53: 133-142 (2018)

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.