{"title":"Domination analysis for scheduling on non preemptive uniformly related machines","authors":"Idan Eisner, A. Vainshtein","doi":"10.46298/DMTCS.2985","DOIUrl":null,"url":null,"abstract":"Idan Eisner, Alek Vainshtein. Domination analysis for scheduling on non preemptive uniformly related machines. Broutin, Nicolas and Devroye, Luc. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA’12), 2012, Montreal, Canada. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA’12), pp.81-82, 2012, DMTCS Proceedings.","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Theoretical Computer Science","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.46298/DMTCS.2985","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Idan Eisner, Alek Vainshtein. Domination analysis for scheduling on non preemptive uniformly related machines. Broutin, Nicolas and Devroye, Luc. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA’12), 2012, Montreal, Canada. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA’12), pp.81-82, 2012, DMTCS Proceedings.
期刊介绍:
DMTCS is a open access scientic journal that is online since 1998. We are member of the Free Journal Network.
Sections of DMTCS
Analysis of Algorithms
Automata, Logic and Semantics
Combinatorics
Discrete Algorithms
Distributed Computing and Networking
Graph Theory.