Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/dialm/HuangRS02
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/dialm/HuangRS02
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Andr%E2%88%9A%C2%A9a_W._Richa
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Hai_Huang_0011
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Michael_Segal_0001
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F570810.570818
>
foaf:
homepage
<
https://doi.org/10.1145/570810.570818
>
dc:
identifier
DBLP conf/dialm/HuangRS02
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F570810.570818
(xsd:string)
dcterms:
issued
2002
(xsd:gYear)
rdfs:
label
Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Andr%E2%88%9A%C2%A9a_W._Richa
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Hai_Huang_0011
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Michael_Segal_0001
>
swrc:
pages
52-61
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/dialm/2002
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/dialm/HuangRS02/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/dialm/HuangRS02
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/dialm/dialm2002.html#HuangRS02
>
rdfs:
seeAlso
<
https://doi.org/10.1145/570810.570818
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/dialm
>
dc:
subject
approximation algorithms, clustering, distributed protocols, mobile ad-hoc networks, piercing set
(xsd:string)
dc:
title
Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document