Scheduling problems over a network of machines

Autor: Mirmahdi Rahgoshay, Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour, Christopher S. Martin, Yifeng Zhang

Publikováno v: Journal of Scheduling. 22:239-253

We consider scheduling problems in which jobs must be processed through a (shared) network of machines. The network is given in the form of a graph, the edges of which represent the machines. We are also given a set of jobs, each specified by its pro

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::b929930c0ae224924ebdac3c597f432a
https://doi.org/10.1007/s10951-018-0591-z

Approximation Schemes for Clustering with Outliers

Autor: Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e4ca09e2d49a6baa55da140ced3f5297
https://doi.org/10.1137/1.9781611975031.27

Approximation Schemes for Clustering with Outliers

Autor: Zachary Friggstad, Mohammad R. Salavatipour, Kamyar Khodamoradi, Mohsen Rezapour

Publikováno v: SODA

Clustering problems are well studied in a variety of fields, such as data science, operations research, and computer science. Such problems include variants of center location problems, k -median and k -means to name a few. In some cases, not all dat

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eaef5a4442d609c3f7f4e761130f4dff

Balls-into-bins with nearly optimal load distribution

Autor: Petra Berenbrink, Thomas Sauerwald, Kamyar Khodamoradi, Alexandre Stauffer

Publikováno v: SPAA
Berenbrink, P, Khodamoradi, K, Sauerwald, T & Stauffer, A 2013, ' Balls-into-bins with nearly optimal load distribution ', Paper presented at SPAA'13: 25th ACM symposium on Parallelism in Algorithms and Architectures, Montreal, Quebec, Canada, 23/07/13-25/07/13 pp. 326-335 . https://doi.org/10.1145/2486159.2486191
Scopus-Elsevier

We consider sequential balls-into-bins processes that randomly allocate m balls into n bins. We analyze two allocation schemes that achieve a close to optimal maximum load of ⌈m/n⌉ + 1 and require only O(m) (expected) allocation time. These param

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::56801d6feee65ffaa617df6a8330b7cd
https://doi.org/10.1145/2486159.2486191