Number of the records: 1  

The Euclidean k-Supplier Problem in R^2

  1. 1.
    0534921 - ÚI 2021 CH eng C - Conference Paper (international conference)
    Basappa, M. - Jallu, Ramesh Kumar - Das, G. K. - Nandy, S. C.
    The Euclidean k-Supplier Problem in R^2.
    Algorithms for Sensor Systems. Cham: Springer, 2017 - (Chrobak, M.; Anta, A.; Gąsieniec, A.; Klasing, R.), s. 129-140. Lecture Notes in Computer Science, 10050. ISBN 978-3-319-53057-4. ISSN 0302-9743.
    [ALGOSENSORS 2016. International Symposium on Algorithms and Experiments for Wireless Sensor Networks /12./. Aarhus (DK), 25.08.2016-26.08.2016]
    Keywords : base-station placement * convex polygon * approximation algorithms * boundary * k-supplier problem * FPT algorithm * Approximation algorithm

    In this paper, we consider k-supplier problem in IR2. Here, two sets of points P and Q are given. The objective is to choose a subset Q(opt) subset of Q of size at most k such that congruent disks of minimum radius centered at the points in Q(opt) cover all the points of P.
    Permanent Link: http://hdl.handle.net/11104/0313056

     
     
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.