Idan Eisner ; Alek Vainshtein - Domination analysis for scheduling on non preemptive uniformly related machines

dmtcs:2985 - Discrete Mathematics & Theoretical Computer Science, January 1, 2012, DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12) - https://doi.org/10.46298/dmtcs.2985
Domination analysis for scheduling on non preemptive uniformly related machinesConference paper

Authors: Idan Eisner 1; Alek Vainshtein 2,1

  • 1 Department of Mathematics [Haïfa]
  • 2 Department of Computer Science [Haifa]


no abstract

https://doi.org/10.46298/dmtcs.2985
Source: HAL:hal-01197235v1
Volume: DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12)
Section: Proceedings
Published on: January 1, 2012
Imported on: January 31, 2017
Keywords: [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [en] Combinatorial optimization, Domination Analysis, Scheduling

Share and export

Consultation statistics

This page has been seen 441 times.
This article's PDF has been downloaded 554 times.