The balloon popping problem revisited: Lower and upper bounds

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 277
  • Download : 0
Issue Date
2009-10-18
Language
ENG
Citation

2nd International Symposium on Algorithmic Game Theory, SAGT 2009, pp.147 - 158

URI
http://hdl.handle.net/10203/160659
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