On minimum m -connected k -dominating set problem in unit disc graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jco/ShangYWH08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jco/ShangYWH08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/F._Frances_Yao
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Peng-Jun_Wan
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Weiping_Shang
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Xiaodong_Hu_0001
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs10878-007-9124-y
>
foaf:
homepage
<
https://doi.org/10.1007/s10878-007-9124-y
>
dc:
identifier
DBLP journals/jco/ShangYWH08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs10878-007-9124-y
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jco
>
rdfs:
label
On minimum m -connected k -dominating set problem in unit disc graphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/F._Frances_Yao
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Peng-Jun_Wan
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Weiping_Shang
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Xiaodong_Hu_0001
>
swrc:
number
2
(xsd:string)
swrc:
pages
99-106
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jco/ShangYWH08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jco/ShangYWH08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jco/jco16.html#ShangYWH08
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s10878-007-9124-y
>
dc:
subject
k-dominating set; m-connectivity; Unit disc graph; Approximation algorithm; Wireless sensor networks
(xsd:string)
dc:
title
On minimum m -connected k -dominating set problem in unit disc graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
16
(xsd:string)