Number of the records: 1
A lower bound on deterministic online algorithms for scheduling on related machines without preemption
SYS 0386905 LBL 01892^^^^^2200325^^^450 005 20240103201922.2 014 $a 84859345015 $2 SCOPUS 017 70
$a 10.1007/978-3-642-29116-6_9 $2 DOI 100 $a 20130320d m y slo 03 ba 101 0-
$a eng $d eng 102 $a DE 200 1-
$a A lower bound on deterministic online algorithms for scheduling on related machines without preemption 215 $a 7 s. $c P 463 -1
$1 001 cav_un_epca*0386904 $1 010 $a 978-3-642-29115-9 $1 200 1 $a Approximation and Online Algorithms $v S. 102-108 $1 205 $a 1. $1 210 $a Heidelberg $c Springer $d 2012 $1 225 $a Lecture Notes in Computer Science $v 7164 $1 702 1 $a Solis-Oba $b R. $4 340 $1 702 1 $a Persiano $b G. $4 340 610 0-
$a algorithm analysis 610 0-
$a problem complexity 610 0-
$a computer science 700 -1
$3 cav_un_auth*0217180 $a Ebenlendr $b Tomáš $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $p MU-W $4 070 $T Matematický ústav AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0257893 $a Sgall $b J. $y CZ $4 070 856 $u http://link.springer.com/chapter/10.1007%2F978-3-642-29116-6_9
Number of the records: 1