[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/focs/Shor91>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Peter_W._Shor>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1991.185444>
foaf:homepage <https://doi.org/10.1109/SFCS.1991.185444>
dc:identifier DBLP conf/focs/Shor91 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FSFCS.1991.185444 (xsd:string)
dcterms:issued 1991 (xsd:gYear)
rdfs:label How to Pack Better than Best Fit: Tight Bounds for Average-Case On-Line Bin Packing (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Peter_W._Shor>
swrc:pages 752-759 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/focs/FOCS32>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/focs/Shor91/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/focs/Shor91>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/focs/focs91.html#Shor91>
rdfs:seeAlso <https://doi.org/10.1109/SFCS.1991.185444>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/focs>
dc:subject 2-D strip packing problem, ball packing, rectangle packing, tight bounds, average-case online bin packing, online algorithm, expected wasted space, lowest bound, stochastic rightward matching problem, half-infinite strip (xsd:string)
dc:title How to Pack Better than Best Fit: Tight Bounds for Average-Case On-Line Bin Packing (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document