BibTeX
@inproceedings{DBLP:conf/random/HazanSS03,
author = {Elad Hazan and
Shmuel Safra and
Oded Schwartz},
title = {On the Complexity of Approximating k-Dimensional Matching},
booktitle = {RANDOM-APPROX},
year = {2003},
pages = {83-97},
ee = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=2764{\&}spage=83},
crossref = {DBLP:conf/random/2003},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/random/2003,
editor = {Sanjeev Arora and
Klaus Jansen and
Jos{\'e} D. P. Rolim and
Amit Sahai},
title = {Approximation, Randomization, and Combinatorial Optimization:
Algorithms and Techniques, 6th International Workshop on
Approximation Algorithms for Combinatorial Optimization
Problems, APPROX 2003 and 7th International Workshop on
Randomization and Approximation Techniques in Computer Science,
RANDOM 2003, Princeton, NY, USA, August 24-26, 2003, Proceedings},
booktitle = {RANDOM-APPROX},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2764},
year = {2003},
isbn = {3-540-40770-7},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2003-12-08 by Michael Ley (ley@uni-trier.de)