"Approximation hardness of dominating set problems in bounded degree graphs."

Miroslav Chlebík, Janka Chlebíková (2008)

> Home

Details and statistics

DOI: 10.1016/J.IC.2008.07.003

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/iandc/ChlebikC08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/ChlebikC08
Miroslav Chlebík, Janka Chlebíková:
Approximation hardness of dominating set problems in bounded degree graphs. Inf. Comput. 206(11): 1264-1275 (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.