Number of the records: 1
First Fit bin packing: a tight analysis
SYS 0424750 LBL 02327^^^^^2200373^^^450 005 20240103203846.7 014 $a 84892596888 $2 SCOPUS 017 70
$a 10.4230/LIPIcs.STACS.2013.538 $2 DOI 100 $a 20140227d m y slo 03 ba 101 0-
$a eng $d eng 102 $a DE 200 1-
$a First Fit bin packing: a tight analysis 215 $a 12 s. $c P 463 -1
$1 001 cav_un_epca*0424755 $1 010 $a 978-3-939897-50-7 $1 011 $a 1868-8969 $1 200 1 $a 30th International Symposium on Theoretical Aspects of Computer Science $v S. 538-549 $1 205 $a 1. $1 210 $a Dagstuhl $c Schloss Dagstuhl, Leibniz-Zentrum für Informatik $d 2013 $1 225 $a Leibniz International Proceedings in Informatics $v 20 $1 702 1 $a Portier $b N. $4 340 $1 702 1 $a Wilke $b T. $4 340 610 0-
$a First Fit 610 0-
$a bin packing 610 0-
$a online algorithms 700 -1
$3 cav_un_auth*0300397 $a Dósa $b G. $y HU $4 070 701 -1
$3 cav_un_auth*0100708 $a Sgall $b Jiří $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. 856 $u http://drops.dagstuhl.de/opus/volltexte/2013/3963/
Number of the records: 1