This HTML5 document contains 39 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n15http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n16http://purl.org/net/nknouf/ns/bibtex#
n22http://linked.opendata.cz/resource/domain/vavai/projekt/
n20http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/resource/domain/vavai/subjekt/
n11http://linked.opendata.cz/ontology/domain/vavai/
n18https://schema.org/
shttp://schema.org/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n19http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F12%3A00387099%21RIV13-AV0-67985840/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F12%3A00387099%21RIV13-AV0-67985840
rdf:type
n11:Vysledek skos:Concept
dcterms:description
We give a simple proof and a generalization of the classical result which says that the (asymptotic) approximation ratio of BestFit algorithm is 1.7. We generalize this result to a wide class of algorithms that are allowed to pack the incoming item to any bin with load larger than 1/2 (if it fits), instead to the most full bin, and at the same time this class includes the bounded-space variants of these algorithms. We give a simple proof and a generalization of the classical result which says that the (asymptotic) approximation ratio of BestFit algorithm is 1.7. We generalize this result to a wide class of algorithms that are allowed to pack the incoming item to any bin with load larger than 1/2 (if it fits), instead to the most full bin, and at the same time this class includes the bounded-space variants of these algorithms.
dcterms:title
A new analysis of best fit bin packing A new analysis of best fit bin packing
skos:prefLabel
A new analysis of best fit bin packing A new analysis of best fit bin packing
skos:notation
RIV/67985840:_____/12:00387099!RIV13-AV0-67985840
n11:predkladatel
n12:ico%3A67985840
n4:aktivita
n17:P
n4:aktivity
P(IAA100190902)
n4:dodaniDat
n7:2013
n4:domaciTvurceVysledku
n20:8679673
n4:druhVysledku
n21:D
n4:duvernostUdaju
n13:S
n4:entitaPredkladatele
n9:predkladatel
n4:idSjednocenehoVysledku
120339
n4:idVysledku
RIV/67985840:_____/12:00387099
n4:jazykVysledku
n5:eng
n4:klicovaSlova
problem complexity; approximation
n4:klicoveSlovo
n6:problem%20complexity n6:approximation
n4:kontrolniKodProRIV
[38E963D72928]
n4:mistoKonaniAkce
Venice
n4:mistoVydani
Heidelberg
n4:nazevZdroje
Fun with Algorithms
n4:obor
n10:BA
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
1
n4:projekt
n22:IAA100190902
n4:rokUplatneniVysledku
n7:2012
n4:tvurceVysledku
Sgall, Jiří
n4:typAkce
n15:WRD
n4:zahajeniAkce
2012-06-04+02:00
s:numberOfPages
7
n19:doi
10.1007/978-3-642-30347-0_31
n16:hasPublisher
Springer-Verlag
n18:isbn
978-3-642-30346-3