Number of the records: 1  

The Euclidean k-Supplier Problem in R^2

  1. SYS0534921
    LBL
      
    01000a^^22220027750^450
    005
      
    20231122145317.7
    014
      
    $a 85011410563 $2 SCOPUS
    014
      
    $a 000425183000009 $2 WOS
    017
    70
    $a 10.1007/978-3-319-53058-1_9 $2 DOI
    100
      
    $a 20201124d m y slo 03 ba
    101
    0-
    $a eng
    102
      
    $a CH
    200
    1-
    $a The Euclidean k-Supplier Problem in R^2
    463
    -1
    $1 001 cav_un_epca*0534923 $1 010 $a 978-3-319-53057-4 $1 011 $a 0302-9743 $1 200 1 $a Algorithms for Sensor Systems $v S. 129-140 $1 210 $a Cham $c Springer $d 2017 $1 225 $a Lecture Notes in Computer Science $v 10050 $1 702 1 $a Chrobak $b M. $4 340 $1 702 1 $4 340 $a Anta $b A.F. $1 702 1 $4 340 $a Gąsieniec $b A.L. $1 702 1 $4 340 $a Klasing $b R.
    608
      
    $a Proceedings Paper
    610
      
    $a base-station placement
    610
      
    $a convex polygon
    610
      
    $a approximation algorithms
    610
      
    $a boundary
    610
      
    $a k-supplier problem
    610
      
    $a FPT algorithm
    610
      
    $a Approximation algorithm
    700
    -1
    $3 cav_un_auth*0399736 $a Basappa $b M. $y IN
    701
    -1
    $3 cav_un_auth*0395715 $a Jallu $b Ramesh Kumar $p UIVT-O $i Oddělení teoretické informatiky $j Department of Theoretical Computer Science $y IN $T Ústav informatiky AV ČR, v. v. i.
    701
    -1
    $3 cav_un_auth*0395717 $a Das $b G. K. $y IN
    701
    -1
    $3 cav_un_auth*0399733 $a Nandy $b S. C. $y IN
Number of the records: 1  

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