pdfformat: 

@InProceedings{berman_et_al:LIPIcs:2010:2883, author = {Piotr Berman and Sofya Raskhodnikova and Ge Ruan}, title = {{Finding Sparser Directed Spanners}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)}, pages = {424435}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897231}, ISSN = {18688969}, year = {2010}, volume = {8}, editor = {Kamal Lodaya and Meena Mahajan}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2883}, URN = {urn:nbn:de:0030drops28830}, doi = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2010.424}, annote = {Keywords: Approximation algorithms, directed graphs, spanners} }
2010
Keywords:  Approximation algorithms, directed graphs, spanners  
Seminar:  IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)  
Issue date:  2010  
Date of publication:  2010 