Go to the corresponding LIPIcs Volume Portal 
Friggstad, Zachary ; Golestanian, Arnoosh ; Khodamoradi, Kamyar ; Martin, Christopher ; Rahgoshay, Mirmahdi ; Rezapour, Mohsen ; Salavatipour, Mohammad R. ; Zhang, Yifeng
pdfformat: 

@InProceedings{friggstad_et_al:LIPIcs:2017:7554, author = {Zachary Friggstad and Arnoosh Golestanian and Kamyar Khodamoradi and Christopher Martin and Mirmahdi Rahgoshay and Mohsen Rezapour and Mohammad R. Salavatipour and Yifeng Zhang}, title = {{Scheduling Problems over Network of Machines}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {5:15:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770446}, ISSN = {18688969}, year = {2017}, volume = {81}, editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and David Williamson and Santosh S. Vempala}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7554}, URN = {urn:nbn:de:0030drops75547}, doi = {10.4230/LIPIcs.APPROXRANDOM.2017.5}, annote = {Keywords: approximation algorithms, jobshop scheduling, minsum edge coloring, minimum latency} }
Keywords:  approximation algorithms, jobshop scheduling, minsum edge coloring, minimum latency  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)  
Issue Date:  2017  
Date of publication:  31.07.2017 