"Hardness results and approximation algorithms for identifying codes and ..."

Sylvain Gravier, Ralf Klasing, Julien Moncel (2008)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2021-02-10

- view
  - electronic edition @ unb.ca (open access)
- export record
  dblp key:
  - journals/aor/GravierKM08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aor/GravierKM08
Sylvain Gravier, Ralf Klasing, Julien Moncel:
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs. Algorithmic Oper. Res. 3(1) (2008)

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.