"The k-hop connected dominating set problem: approximation and hardness."

Rafael S. Coelho, Phablo F. S. Moura, Yoshiko Wakabayashi (2017)

> Home

Details and statistics

DOI: 10.1007/S10878-017-0128-Y

access: closed

type: Journal Article

metadata version: 2020-10-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/CoelhoMW17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/CoelhoMW17
Rafael S. Coelho, Phablo F. S. Moura, Yoshiko Wakabayashi:
The k-hop connected dominating set problem: approximation and hardness. J. Comb. Optim. 34(4): 1060-1083 (2017)

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.