Go to the corresponding LIPIcs Volume Portal 
Cygan, Marek ; Grandoni, Fabrizio ; Leonardi, Stefano ; Mucha, Marcin ; Pilipczuk, Marcin ; Sankowski, Piotr
pdfformat: 

@InProceedings{cygan_et_al:LIPIcs:2011:3321, author = {Marek Cygan and Fabrizio Grandoni and Stefano Leonardi and Marcin Mucha and Marcin Pilipczuk and Piotr Sankowski}, title = {{Approximation Algorithms for Union and Intersection Covering Problems }}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)}, pages = {2840}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897347}, ISSN = {18688969}, year = {2011}, volume = {13}, editor = {Supratik Chakraborty and Amit Kumar}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3321}, URN = {urn:nbn:de:0030drops33213}, doi = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2011.28}, annote = {Keywords: Approximation algorithms, Partial covering problems} }
Keywords:  Approximation algorithms, Partial covering problems  
Seminar:  IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)  
Issue Date:  2011  
Date of publication:  01.12.2011 