A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/cocoon/BhattacharyaK12
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/cocoon/BhattacharyaK12
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Binay_K._Bhattacharya
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Tsunehiko_Kameda
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-642-32241-9%5F1
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-642-32241-9_1
>
dc:
identifier
DBLP conf/cocoon/BhattacharyaK12
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-642-32241-9%5F1
(xsd:string)
dcterms:
issued
2012
(xsd:gYear)
rdfs:
label
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Binay_K._Bhattacharya
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Tsunehiko_Kameda
>
swrc:
pages
1-12
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/cocoon/2012
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/cocoon/BhattacharyaK12/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/cocoon/BhattacharyaK12
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/cocoon/cocoon2012.html#BhattacharyaK12
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-642-32241-9_1
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/cocoon
>
dc:
title
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document