@InProceedings{saket:LIPIcs.FSTTCS.2010.447,
author = {Saket, Rishi},
title = {{Quasi-Random PCP and Hardness of 2-Catalog Segmentation}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {447--458},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.447},
URN = {urn:nbn:de:0030-drops-28858},
doi = {10.4230/LIPIcs.FSTTCS.2010.447},
annote = {Keywords: Hardness of Approximation, PCPs, Catalog Segmentation}
}