File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

VigneronAntoine

Vigneron, Antoine
Geometric Algorithms Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.conferencePlace JA -
dc.citation.conferencePlace Yokohama -
dc.citation.endPage 59 -
dc.citation.startPage 50 -
dc.citation.title ISAAC 2011 (The 22nd International Symposium on Algorithms and Computation) -
dc.contributor.author Ahn, Hee-Kap -
dc.contributor.author Kim, Sang-Sub -
dc.contributor.author Knauer, Christian -
dc.contributor.author Schlipf, Lena -
dc.contributor.author Shin, Chan-Su -
dc.contributor.author Vigneron, Antoine -
dc.date.accessioned 2023-12-20T02:36:53Z -
dc.date.available 2023-12-20T02:36:53Z -
dc.date.created 2016-06-21 -
dc.date.issued 2011-12-06 -
dc.description.abstract We consider new versions of the two-center problem where the input consists of a set D of disks in the plane. We first study the problem of finding two smallest congruent disks such that each disk in intersects one of these two disks. Then we study the problem of covering the set D by two smallest congruent disks. We give exact and approximation algorithms for these versions. © 2011 Springer-Verlag. -
dc.identifier.bibliographicCitation ISAAC 2011 (The 22nd International Symposium on Algorithms and Computation), pp.50 - 59 -
dc.identifier.doi 10.1007/978-3-642-25591-5_7 -
dc.identifier.issn 0302-9743 -
dc.identifier.scopusid 2-s2.0-84055193615 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/34446 -
dc.identifier.url http://www.is.titech.ac.jp/isaac11/ -
dc.language 영어 -
dc.publisher ISAAC 2011 -
dc.title Covering and piercing disks with two centers -
dc.type Conference Paper -
dc.date.conferenceDate 2011-12-05 -

qrcode

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