On finding a guard that sees most and a shop that sells most

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 302
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorCheong, Otfried-
dc.contributor.authorEfrat, Alon-
dc.contributor.authorHar-Peled, Sariel-
dc.date.accessioned2013-03-18T08:35:02Z-
dc.date.available2013-03-18T08:35:02Z-
dc.date.created2012-02-06-
dc.date.issued2004-01-13-
dc.identifier.citationThe 15th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2004, v., no., pp.1091 - 1100-
dc.identifier.urihttp://hdl.handle.net/10203/146572-
dc.languageENG-
dc.titleOn finding a guard that sees most and a shop that sells most-
dc.typeConference-
dc.type.rimsCONF-
dc.citation.beginningpage1091-
dc.citation.endingpage1100-
dc.citation.publicationnameThe 15th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2004-
dc.identifier.conferencecountryUnited States-
dc.identifier.conferencecountryUnited States-
dc.contributor.localauthorCheong, Otfried-
dc.contributor.nonIdAuthorEfrat, Alon-
dc.contributor.nonIdAuthorHar-Peled, Sariel-
Appears in Collection
CS-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