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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F12%3A00386905%21RIV13-AV0-67985840
rdf:type
skos:Concept n9:Vysledek
dcterms:description
We prove a new lower bound of 2.564 on deterministic online algorithms for makespan scheduling on related machines (without preemptions). Previous lower bound was 2.438 by Berman et al. We use an analytical bound on maximal frequency of scheduling jobs instead of the combinatorial bound obtained by computer based search through the graph of possible states of an algorithm in the previous work. We prove a new lower bound of 2.564 on deterministic online algorithms for makespan scheduling on related machines (without preemptions). Previous lower bound was 2.438 by Berman et al. We use an analytical bound on maximal frequency of scheduling jobs instead of the combinatorial bound obtained by computer based search through the graph of possible states of an algorithm in the previous work.
dcterms:title
A lower bound on deterministic online algorithms for scheduling on related machines without preemption A lower bound on deterministic online algorithms for scheduling on related machines without preemption
skos:prefLabel
A lower bound on deterministic online algorithms for scheduling on related machines without preemption A lower bound on deterministic online algorithms for scheduling on related machines without preemption
skos:notation
RIV/67985840:_____/12:00386905!RIV13-AV0-67985840
n9:predkladatel
n10:ico%3A67985840
n3:aktivita
n15:Z n15:P
n3:aktivity
P(1M0545), P(IAA100190902), Z(AV0Z10190503)
n3:dodaniDat
n6:2013
n3:domaciTvurceVysledku
n12:7083556
n3:druhVysledku
n23:D
n3:duvernostUdaju
n18:S
n3:entitaPredkladatele
n16:predkladatel
n3:idSjednocenehoVysledku
120285
n3:idVysledku
RIV/67985840:_____/12:00386905
n3:jazykVysledku
n7:eng
n3:klicovaSlova
algorithm analysis; problem complexity; computer science
n3:klicoveSlovo
n4:problem%20complexity n4:algorithm%20analysis n4:computer%20science
n3:kontrolniKodProRIV
[73F6EB46A812]
n3:mistoKonaniAkce
Saarbrücken
n3:mistoVydani
Heidelberg
n3:nazevZdroje
Approximation and online algorithms
n3:obor
n14:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:projekt
n5:IAA100190902 n5:1M0545
n3:rokUplatneniVysledku
n6:2012
n3:tvurceVysledku
Sgall, J. Ebenlendr, Tomáš
n3:typAkce
n19:WRD
n3:zahajeniAkce
2011-09-08+02:00
n3:zamer
n22:AV0Z10190503
s:numberOfPages
7
n8:doi
10.1007/978-3-642-29116-6_9
n20:hasPublisher
Springer-Verlag
n21:isbn
978-3-642-29115-9