"Average-case complexity of a branch-and-bound algorithm for Min Dominating ..."

Tom Denat et al. (2024)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2023.11.021

access: closed

type: Journal Article

metadata version: 2024-02-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/DenatHMP24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/DenatHMP24
Tom Denat, Ararat Harutyunyan, Nikolaos Melissinos, Vangelis Th. Paschos:
Average-case complexity of a branch-and-bound algorithm for Min Dominating Set. Discret. Appl. Math. 345: 4-8 (2024)

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.