Zobrazeno 1 - 10
of 648
pro vyhledávání: '"Marchetti Spaccamela, A."'
Autor:
Bosman, Thomas, van Ee, Martijn, Ergen, Ekin, Imreh, Csanad, Marchetti-Spaccamela, Alberto, Skutella, Martin, Stougie, Leen
Scheduling jobs with given processing times on identical parallel machines so as to minimize their total completion time is one of the most basic scheduling problems. We study interesting generalizations of this classical problem involving scenarios.
Externí odkaz:
http://arxiv.org/abs/2402.19259
Autor:
Bernardini, Giulia, Lindermayr, Alexander, Marchetti-Spaccamela, Alberto, Megow, Nicole, Stougie, Leen, Sweering, Michelle
We introduce a novel measure for quantifying the error in input predictions. The error is based on a minimum-cost hyperedge cover in a suitably defined hypergraph and provides a general template which we apply to online graph problems. The measure ca
Externí odkaz:
http://arxiv.org/abs/2205.12850
Autor:
Bosman, Thomas, van Ee, Martijn, Jiao, Yang, Marchetti-Spaccamela, Alberto, Ravi, R., Stougie, Leen
We introduce and study a class of optimization problems we coin replenishment problems with fixed turnover times: a very natural model that has received little attention in the literature. Nodes with capacity for storing a certain commodity are locat
Externí odkaz:
http://arxiv.org/abs/1712.05218
Autor:
Feuerstein, Esteban, Marchetti-Spaccamela, Alberto, Schalekamp, Frans, Sitters, Rene, van der Ster, Suzanne, Stougie, Leen, van Zuylen, Anke
We consider scheduling problems over scenarios where the goal is to find a single assignment of the jobs to the machines which performs well over all possible scenarios. Each scenario is a subset of jobs that must be executed in that scenario and all
Externí odkaz:
http://arxiv.org/abs/1404.4766
Publikováno v:
Proceedings of the 2013 25th Euromicro Conference on Real-Time Systems
A model has been proposed in [Baruah et al., in Proceedings of the IEEE Real-Time Systems Symposium 2012] for representing recurrent precedence-constrained tasks to be executed on multiprocessor platforms, where each recurrent task is modeled by a di
Externí odkaz:
http://arxiv.org/abs/1212.2778
Several social-aware forwarding strategies have been recently introduced in opportunistic networks, and proved effective in considerably in- creasing routing performance through extensive simulation studies based on real-world data. However, this per
Externí odkaz:
http://arxiv.org/abs/1007.5240
Publikováno v:
Algorithmica, 63(4):763-780, 2012
We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a set of identical processors, solving one major open problem in the area of multiprocessor real-time scheduling [S.K. Baruah and K. Pruhs, Journal of
Externí odkaz:
http://arxiv.org/abs/1004.2033
Autor:
Chan, Ho-Leung, Edmonds, Jeff, Lam, Tak-Wah, Lee, Lap-Kei, Marchetti-Spaccamela, Alberto, Pruhs, Kirk
Publikováno v:
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 (2009) 255-264
We study online nonclairvoyant speed scaling to minimize total flow time plus energy. We first consider the traditional model where the power function is P (s) = s\^\propto. We give a nonclairvoyant algorithm that is shown to be O(\propto\^3)-competi
Externí odkaz:
http://arxiv.org/abs/0902.1260
Publikováno v:
ACM Transactions on Algorithms 7(3): 33:1-33:20 (2011)
We address the problem of efficient data gathering in a wireless network through multi-hop communication. We focus on the objective of minimizing the maximum flow time of a data packet. We prove that no polynomial time algorithm for this problem can
Externí odkaz:
http://arxiv.org/abs/0802.2836
Autor:
Yang Jiao, R. Ravi, Thomas Bosman, Martijn van Ee, Leen Stougie, Alberto Marchetti-Spaccamela
Publikováno v:
LATIN 2018: Theoretical Informatics ISBN: 9783319774039
LATIN
LATIN 2018-13th Latin American Symposium on Theoretical Informatics
LATIN 2018-13th Latin American Symposium on Theoretical Informatics, Apr 2018, Buenos Aires, Argentina. pp.217-230
Algorithmica
Algorithmica, 2022, 84 (9), pp.2597-2621. ⟨10.1007/s00453-022-00974-4⟩
Bosman, T, van Ee, M, Jiao, Y, Marchetti-Spaccamela, A, Ravi, R & Stougie, L 2018, Approximation algorithms for replenishment problems with fixed turnover times . in M A Bender, M Farach-Colton & M A Mosteiro (eds), LATIN 2018: Theoretical Informatics : 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10807 LNCS, Springer/Verlag, pp. 217-230, 13th International Symposium on Latin American Theoretical Informatics, LATIN 2018, Buenos Aires, Argentina, 16/04/18 . https://doi.org/10.1007/978-3-319-77404-6_17
Algorithmica, 84, 2597-2621
Bosman, T, van Ee, M, Jiao, Y, Marchetti-Spaccamela, A, Ravi, R & Stougie, L 2022, ' Approximation Algorithms for Replenishment Problems with Fixed Turnover Times ', Algorithmica, vol. 84, no. 9, pp. 2597-2621 . https://doi.org/10.1007/s00453-022-00974-4
LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings, 217-230
STARTPAGE=217;ENDPAGE=230;TITLE=LATIN 2018: Theoretical Informatics
Algorithmica, 84(9), 2597-2621. Springer New York
LATIN
LATIN 2018-13th Latin American Symposium on Theoretical Informatics
LATIN 2018-13th Latin American Symposium on Theoretical Informatics, Apr 2018, Buenos Aires, Argentina. pp.217-230
Algorithmica
Algorithmica, 2022, 84 (9), pp.2597-2621. ⟨10.1007/s00453-022-00974-4⟩
Bosman, T, van Ee, M, Jiao, Y, Marchetti-Spaccamela, A, Ravi, R & Stougie, L 2018, Approximation algorithms for replenishment problems with fixed turnover times . in M A Bender, M Farach-Colton & M A Mosteiro (eds), LATIN 2018: Theoretical Informatics : 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10807 LNCS, Springer/Verlag, pp. 217-230, 13th International Symposium on Latin American Theoretical Informatics, LATIN 2018, Buenos Aires, Argentina, 16/04/18 . https://doi.org/10.1007/978-3-319-77404-6_17
Algorithmica, 84, 2597-2621
Bosman, T, van Ee, M, Jiao, Y, Marchetti-Spaccamela, A, Ravi, R & Stougie, L 2022, ' Approximation Algorithms for Replenishment Problems with Fixed Turnover Times ', Algorithmica, vol. 84, no. 9, pp. 2597-2621 . https://doi.org/10.1007/s00453-022-00974-4
LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings, 217-230
STARTPAGE=217;ENDPAGE=230;TITLE=LATIN 2018: Theoretical Informatics
Algorithmica, 84(9), 2597-2621. Springer New York
We introduce and study a class of optimization problems we call replenishment problems with fixed turnover times: a very natural model that has received little attention in the literature. Clients with capacity for storing a certain commodity are loc