All farthest neighbors in the presence of highways and obstacles

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 285
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorBae S.W.-
dc.contributor.authorKorman M.-
dc.contributor.authorTokuyama T.-
dc.date.accessioned2013-03-26T00:18:10Z-
dc.date.available2013-03-26T00:18:10Z-
dc.date.created2012-02-06-
dc.date.issued2009-02-18-
dc.identifier.citation3rd International Workshop on Algorithms and Computation, WALCOM 2009, v., no., pp.71 - 82-
dc.identifier.urihttp://hdl.handle.net/10203/156318-
dc.languageENG-
dc.titleAll farthest neighbors in the presence of highways and obstacles-
dc.typeConference-
dc.identifier.scopusid2-s2.0-67650503955-
dc.type.rimsCONF-
dc.citation.beginningpage71-
dc.citation.endingpage82-
dc.citation.publicationname3rd International Workshop on Algorithms and Computation, WALCOM 2009-
dc.identifier.conferencecountryIndia-
dc.identifier.conferencecountryIndia-
dc.contributor.localauthorBae S.W.-
dc.contributor.nonIdAuthorKorman M.-
dc.contributor.nonIdAuthorTokuyama T.-
Appears in Collection
RIMS Conference Papers
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0