Cargando…
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds
We consider the Vector Scheduling problem, a natural generalization of the classical makespan minimization problem to multiple resources. Here, we are given n jobs, represented as d-dimensional vectors in [Formula: see text] , and m identical machines, and the goal is to assign the jobs to machines...
Autores principales: | Bansal, Nikhil, Oosterwijk, Tim, Vredeveld, Tjark, van der Zwaan, Ruben |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7175655/ https://www.ncbi.nlm.nih.gov/pubmed/32355383 http://dx.doi.org/10.1007/s00453-016-0116-0 |
Ejemplares similares
-
Lower bounds for the low-rank matrix approximation
por: Li, Jicheng, et al.
Publicado: (2017) -
An Upper Bound on the Error Induced by Saddlepoint Approximations—Applications to Information Theory †
por: Anade, Dadja, et al.
Publicado: (2020) -
Upper and lower bounds for the Bregman divergence
por: Sprung, Benjamin
Publicado: (2019) -
Bounded and almost periodic solutions of nonlinear operator differential equations
por: Pankov, A A
Publicado: (1990) -
Maximum common subgraph: some upper bound and lower bound results
por: Huang, Xiuzhen, et al.
Publicado: (2006)