DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ahn, HK | - |
dc.contributor.author | Cheong, O | - |
dc.contributor.author | Shin, CS | - |
dc.date.accessioned | 2016-04-01T08:42:00Z | - |
dc.date.available | 2016-04-01T08:42:00Z | - |
dc.date.created | 2009-08-18 | - |
dc.date.issued | 2003-05 | - |
dc.identifier.issn | 0925-7721 | - |
dc.identifier.other | 2003-OAK-0000017733 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/28568 | - |
dc.description.abstract | In 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.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.relation.isPartOf | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
dc.title | BUILDING BRIDGES BETWEEN CONVEX REGIONS | - |
dc.type | Article | - |
dc.contributor.college | 컴퓨터공학과 | - |
dc.identifier.doi | 10.1016/S0925-7721(02)00135-9 | - |
dc.author.google | Ahn, HK | - |
dc.author.google | Cheong, O | - |
dc.author.google | Shin, CS | - |
dc.relation.volume | 25 | - |
dc.relation.issue | 1-2 | - |
dc.relation.startpage | 161 | - |
dc.relation.lastpage | 170 | - |
dc.contributor.id | 10152366 | - |
dc.relation.journal | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCIE | - |
dc.collections.name | Conference Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.25, no.1-2, pp.161 - 170 | - |
dc.identifier.wosid | 000181567300011 | - |
dc.date.tcdate | 2019-02-01 | - |
dc.citation.endPage | 170 | - |
dc.citation.number | 1-2 | - |
dc.citation.startPage | 161 | - |
dc.citation.title | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
dc.citation.volume | 25 | - |
dc.contributor.affiliatedAuthor | Ahn, HK | - |
dc.identifier.scopusid | 2-s2.0-84867949543 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 1 | - |
dc.description.isOpenAccess | N | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.subject.keywordAuthor | euclidean TSP | - |
dc.subject.keywordAuthor | TSP with neighborhoods | - |
dc.subject.keywordAuthor | traveling salesman and buyers problem | - |
dc.subject.keywordAuthor | approximation algorithm | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.relation.journalWebOfScienceCategory | Mathematics | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Mathematics | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.