• Login
    View Item 
    •   Home
    • Research
    • Conference Papers
    • View Item
    •   Home
    • Research
    • Conference Papers
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Covering and piercing disks with two centers

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Conference Paper
    Authors
    Ahn, Heekap
    Kim, Sangsub
    Knauer, Christian
    Schlipf, Lena
    Shin, Chansu
    Vigneron, Antoine E. cc
    KAUST Department
    Visual Computing Center (VCC)
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Computer Science Program
    Geometric Algorithms Group
    Date
    2011
    Permanent link to this record
    http://hdl.handle.net/10754/564326
    
    Metadata
    Show full item record
    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.
    Citation
    Ahn, H.-K., Kim, S.-S., Knauer, C., Schlipf, L., Shin, C.-S., & Vigneron, A. (2011). Covering and Piercing Disks with Two Centers. Lecture Notes in Computer Science, 50–59. doi:10.1007/978-3-642-25591-5_7
    Publisher
    Springer Nature
    Journal
    Lecture Notes in Computer Science
    Conference/Event name
    22nd International Symposium on Algorithms and Computation, ISAAC 2011
    ISBN
    9783642255908
    DOI
    10.1007/978-3-642-25591-5_7
    ae974a485f413a2113503eed53cd6c53
    10.1007/978-3-642-25591-5_7
    Scopus Count
    Collections
    Conference Papers; Computer Science Program; Visual Computing Center (VCC); Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.