DSpace at KOASAS
College of Engineering(공과대학)School of Computing(전산학부)CS-Journal Papers(저널논문)

Building bridges between convex regions

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 964
  • Download : 461
Export
DC FieldValueLanguage
dc.contributor.authorAhn, HKko
dc.contributor.authorCheong, Otfriedko
dc.contributor.authorShin, CSko
dc.date.accessioned2007-05-23T09:53:16Z-
dc.date.available2007-05-23T09:53:16Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2003-05-
dc.identifier.citationCOMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.25, pp.161 - 170-
dc.identifier.issn0925-7721-
dc.identifier.urihttp://hdl.handle.net/10203/310-
dc.description.abstractIn the Euclidean traveling salesman and buyers problem (TSBP), we are given a set of convex regions in d-dimensional space, and we wish to find a minimum-cost tour that visits all the regions. The cost of a tour depends on the length of the tour itself and on the distance that buyers within each region need to travel to meet the salesman. We show that constant-factor approximations to the TSBP and several similar problems can be obtained by visiting the centers of the smallest enclosing spheres of the regions. (C) 2002 Elsevier Science B.V. All rights reserved.-
dc.description.sponsorshipPart of this research was done when the three authors were at Hong Kong University of Science & Technology. It was partially supported by the Hong Kong Research Grants Council.en
dc.languageEnglish-
dc.language.isoenen
dc.publisherELSEVIER SCIENCE BV-
dc.subjectPOLYGONS-
dc.subjectALGORITHMS-
dc.titleBuilding bridges between convex regions-
dc.typeArticle-
dc.identifier.wosid000181567300011-
dc.identifier.scopusid2-s2.0-84867949543-
dc.type.rimsART-
dc.citation.volume25-
dc.citation.beginningpage161-
dc.citation.endingpage170-
dc.citation.publicationnameCOMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS-
dc.identifier.doi10.1016/S0925-7721(02)00135-9-
dc.embargo.liftdate9999-12-31-
dc.embargo.terms9999-12-31-
dc.contributor.localauthorCheong, Otfried-
dc.contributor.nonIdAuthorAhn, HK-
dc.contributor.nonIdAuthorShin, CS-
dc.type.journalArticleArticle; Proceedings Paper-
dc.subject.keywordAuthoreuclidean TSP-
dc.subject.keywordAuthorTSP with neighborhoods-
dc.subject.keywordAuthortraveling salesman and buyers problem-
dc.subject.keywordAuthorapproximation algorithm-
dc.subject.keywordPlusPOLYGONS-
dc.subject.keywordPlusALGORITHMS-
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

Display Simple Item Record

qr_code

  • mendeley

    citeulike

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


rss_1.0 rss_2.0 atom_1.0