The balloon popping problem revisited: Lower and upper bounds

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 316
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorJung H.-
dc.contributor.authorChwa, Kyung Yong-
dc.date.accessioned2013-03-27T08:06:11Z-
dc.date.available2013-03-27T08:06:11Z-
dc.date.created2012-02-06-
dc.date.issued2009-10-18-
dc.identifier.citation2nd International Symposium on Algorithmic Game Theory, SAGT 2009, v., no., pp.147 - 158-
dc.identifier.urihttp://hdl.handle.net/10203/160659-
dc.languageENG-
dc.titleThe balloon popping problem revisited: Lower and upper bounds-
dc.typeConference-
dc.identifier.scopusid2-s2.0-71549137768-
dc.type.rimsCONF-
dc.citation.beginningpage147-
dc.citation.endingpage158-
dc.citation.publicationname2nd International Symposium on Algorithmic Game Theory, SAGT 2009-
dc.identifier.conferencecountryGreece-
dc.contributor.localauthorChwa, Kyung Yong-
dc.contributor.nonIdAuthorJung H.-
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