Open Access System for Information Sharing

Login Library

 

Article
Cited 1 time in webofscience Cited 2 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.authorAhn, HK-
dc.contributor.authorCheong, O-
dc.contributor.authorShin, CS-
dc.date.accessioned2016-04-01T08:42:00Z-
dc.date.available2016-04-01T08:42:00Z-
dc.date.created2009-08-18-
dc.date.issued2003-05-
dc.identifier.issn0925-7721-
dc.identifier.other2003-OAK-0000017733-
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/28568-
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.-
dc.description.statementofresponsibilityX-
dc.languageEnglish-
dc.publisherELSEVIER SCIENCE BV-
dc.relation.isPartOfCOMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS-
dc.titleBUILDING BRIDGES BETWEEN CONVEX REGIONS-
dc.typeArticle-
dc.contributor.college컴퓨터공학과-
dc.identifier.doi10.1016/S0925-7721(02)00135-9-
dc.author.googleAhn, HK-
dc.author.googleCheong, O-
dc.author.googleShin, CS-
dc.relation.volume25-
dc.relation.issue1-2-
dc.relation.startpage161-
dc.relation.lastpage170-
dc.contributor.id10152366-
dc.relation.journalCOMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS-
dc.relation.indexSCI급, SCOPUS 등재논문-
dc.relation.sciSCIE-
dc.collections.nameConference Papers-
dc.type.rimsART-
dc.identifier.bibliographicCitationCOMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.25, no.1-2, pp.161 - 170-
dc.identifier.wosid000181567300011-
dc.date.tcdate2019-02-01-
dc.citation.endPage170-
dc.citation.number1-2-
dc.citation.startPage161-
dc.citation.titleCOMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS-
dc.citation.volume25-
dc.contributor.affiliatedAuthorAhn, HK-
dc.identifier.scopusid2-s2.0-84867949543-
dc.description.journalClass1-
dc.description.journalClass1-
dc.description.wostc1-
dc.description.isOpenAccessN-
dc.type.docTypeArticle; Proceedings Paper-
dc.subject.keywordAuthoreuclidean TSP-
dc.subject.keywordAuthorTSP with neighborhoods-
dc.subject.keywordAuthortraveling salesman and buyers problem-
dc.subject.keywordAuthorapproximation algorithm-
dc.relation.journalWebOfScienceCategoryMathematics, Applied-
dc.relation.journalWebOfScienceCategoryMathematics-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.relation.journalResearchAreaMathematics-

qr_code

  • mendeley

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

Related Researcher

Researcher

안희갑AHN, HEE-KAP
Grad. School of AI
Read more

Views & Downloads

Browse