Conference Paper: Minimum Manhattan network is NP-complete

File Download
Supplementary
  • Basic View
  • Metadata View
  • XML View
TitleMinimum Manhattan network is NP-complete
AuthorsChin, FYL
Guo, Z
Sun, H
Issue Date2009
CitationThe 2nd Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2009), Hangzhou, China, 11-12 April 2009. [How to Cite?]
DescriptionSession 3-A
DC Field
Value
dc.contributor.authorChin, FYL
dc.contributor.authorGuo, Z
dc.contributor.authorSun, H
dc.date.accessioned2010-07-13T03:32:57Z
dc.date.available2010-07-13T03:32:57Z
dc.date.issued2009
dc.descriptionSession 3-A
dc.description.otherThe 2nd Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2009), Hangzhou, China, 11-12 April 2009.
dc.identifier.citationThe 2nd Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2009), Hangzhou, China, 11-12 April 2009. [How to Cite?]
dc.identifier.hkuros166441
dc.identifier.urihttp://hdl.handle.net/10722/61196
dc.languageeng
dc.publisher.placeHangzhou, China
dc.relation.ispartofAnnual Meeting of Asian Association for Algorithms and Computation, AAAC 2009
dc.titleMinimum Manhattan network is NP-complete
dc.typeConference_Paper