Minmax Tree Cover in the Euclidean Space.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/walcom/KarakawaMN09
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/walcom/KarakawaMN09
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ehab_Morsy
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Hiroshi_Nagamochi
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Seigo_Karakawa
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-642-00202-1%5F18
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-642-00202-1_18
>
dc:
identifier
DBLP conf/walcom/KarakawaMN09
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-642-00202-1%5F18
(xsd:string)
dcterms:
issued
2009
(xsd:gYear)
rdfs:
label
Minmax Tree Cover in the Euclidean Space.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ehab_Morsy
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Hiroshi_Nagamochi
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Seigo_Karakawa
>
swrc:
pages
202-213
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/walcom/2009
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/walcom/KarakawaMN09/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/walcom/KarakawaMN09
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/walcom/walcom2009.html#KarakawaMN09
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-642-00202-1_18
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/walcom
>
dc:
subject
Minmax Tree Cover; Balanced Partition; Tree Cover; Approximation Algorithms; Graph Algorithms
(xsd:string)
dc:
title
Minmax Tree Cover in the Euclidean Space.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document