pdfformat: 

@InProceedings{sarpatwar_et_al:LIPIcs:2018:9428, author = {Kanthi Sarpatwar and Baruch Schieber and Hadas Shachnai}, title = {{Generalized Assignment of TimeSensitive Item Groups}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)}, pages = {24:124:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770859}, ISSN = {18688969}, year = {2018}, volume = {116}, editor = {Eric Blais and Klaus Jansen and Jos{\'e} D. P. Rolim and David Steurer}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9428}, URN = {urn:nbn:de:0030drops94287}, doi = {10.4230/LIPIcs.APPROXRANDOM.2018.24}, annote = {Keywords: Approximation Algorithms, Packing and Covering problems, Generalized Assignment problem} }
Keywords:  Approximation Algorithms, Packing and Covering problems, Generalized Assignment problem  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)  
Issue date:  2018  
Date of publication:  2018 