Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Karavasilis, Christodoulos"'
In the problem of online unweighted interval selection, the objective is to maximize the number of non-conflicting intervals accepted by the algorithm. In the conventional online model of irrevocable decisions, there is an Omega(n) lower bound on the
Externí odkaz:
http://arxiv.org/abs/2407.20941
We consider the problem of online interval scheduling on a single machine, where intervals arrive online in an order chosen by an adversary, and the algorithm must output a set of non-conflicting intervals. Traditionally in scheduling theory, it is a
Externí odkaz:
http://arxiv.org/abs/2303.06127
We perform an experimental study of algorithms for online bipartite matching under the known i.i.d. input model with integral types. In the last decade, there has been substantial effort in designing complex algorithms with the goal of improving wors
Externí odkaz:
http://arxiv.org/abs/1808.04863
We introduce a new random input model for bipartite matching which we call the Random Type Poisson Arrival Model. Just like in the known i.i.d. model (introduced by Feldman et al. 2009), online nodes have types in our model. In contrast to the advers
Externí odkaz:
http://arxiv.org/abs/1805.00578
Publikováno v:
Journal of Experimental Algorithmics (JEA); Jul2020, Vol. 25 Issue 1, p1-37, 37p
Autor:
Βαγενάς, Κωνσταντίνος, Karavasilis, Christodoulos, Βερύκιος, Ξενοφών, Κουτσούκος, Π., Λυκουργιώτης, Α., Παπαθεοδώρου, Γ., Λαδάς, Σ., Μπεμπέλης, Σ.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1047::403e09de2cde5e24feacd25c4f49cd3c
http://nemertes.lis.upatras.gr/jspui/handle/10889/2414
http://nemertes.lis.upatras.gr/jspui/handle/10889/2414