"Minimum-Cost b-Edge Dominating Sets on Trees."

Takehiro Ito et al. (2019)

> Home

Details and statistics

DOI: 10.1007/S00453-018-0448-Z

access: closed

type: Journal Article

metadata version: 2019-01-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/ItoKKKO19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/ItoKKKO19
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Minimum-Cost b-Edge Dominating Sets on Trees. Algorithmica 81(1): 343-366 (2019)

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.