Počet záznamů: 1  

Peeling Potatoes Near-optimally in Near-linear Time

  1. SYS0478998
    LBL
      
    01000a^^22220027750^450
    005
      
    20190301114756.5
    014
      
    $a 85032943193 $2 SCOPUS
    014
      
    $a 000416763900004 $2 WOS
    017
      
    $a 10.1137/16M1079695 $2 DOI
    100
      
    $a 20171006d m y slo 03 ba
    101
      
    $a eng
    102
      
    $a US
    200
    1-
    $a Peeling Potatoes Near-optimally in Near-linear Time
    215
      
    $a 29 s.
    463
    -1
    $1 001 cav_un_epca*0255071 $1 011 $a 0097-5397 $1 200 1 $a Siam Journal on Computing $v Roč. 46, č. 5 (2017), s. 1574-1602
    610
      
    $a geometric optimization
    610
      
    $a potato peeling
    610
      
    $a visibility graph
    610
      
    $a geometric probability
    610
      
    $a approximation algorithm
    700
    -1
    $3 cav_un_auth*0349986 $a Cabello $b S. $y SI
    701
    -1
    $3 cav_un_auth*0039721 $a Cibulka $b J. $y CZ
    701
    -1
    $3 cav_un_auth*0207062 $a Kynčl $b J. $y CZ
    701
    -1
    $3 cav_un_auth*0348574 $a Saumell $b Maria $p UIVT-O $o Department of Theoretical Computer Science $y CZ $T Ústav informatiky AV ČR, v. v. i.
    701
    -1
    $3 cav_un_auth*0348904 $a Valtr $b P. $y CZ