Minimax Linear Placement문제에 관한 연구On Approximation Algorithms for the Minimax Linear Placement Problem

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 351
  • Download : 0
DC FieldValueLanguage
dc.contributor.author좌경룡ko
dc.contributor.author유관우ko
dc.date.accessioned2013-02-24T12:19:44Z-
dc.date.available2013-02-24T12:19:44Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued1982-11-
dc.identifier.citation정보과학회논문지, v.9, no.4, pp.13 - 22-
dc.identifier.issn0258-9125-
dc.identifier.urihttp://hdl.handle.net/10203/57083-
dc.languageKorean-
dc.publisher한국정보과학회-
dc.titleMinimax Linear Placement문제에 관한 연구-
dc.title.alternativeOn Approximation Algorithms for the Minimax Linear Placement Problem-
dc.typeArticle-
dc.type.rimsART-
dc.citation.volume9-
dc.citation.issue4-
dc.citation.beginningpage13-
dc.citation.endingpage22-
dc.citation.publicationname정보과학회논문지-
dc.contributor.localauthor좌경룡-
dc.contributor.nonIdAuthor유관우-
dc.description.isOpenAccessN-
Appears in Collection
CS-Journal 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