Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
COCOON
/
Paper
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree.
Binay K. Bhattacharya
,
Tsunehiko Kameda
Venue
National
COCOON
Year
2012
Proceedings
COCOON
DBLP record
conf/cocoon/BhattacharyaK12 ↗
Browse the full
COCOON paper archive
.