%0 Conference Paper %1 conf/icst/NieJWLC13 %A Nie, Changhai %A Jiang, Jing %A Wu, Huayao %A Leung, Hareton %A Colbourn, Charles J. %B ICST Workshops %D 2013 %I IEEE Computer Society %K dblp %P 239-248 %T Empirically Identifying the Best Greedy Algorithm for Covering Array Generation. %U http://dblp.uni-trier.de/db/conf/icst/icstw2013.html#NieJWLC13 %@ 978-1-4799-1324-4

@inproceedings{conf/icst/NieJWLC13, added-at = {2014-08-05T00:00:00.000+0200}, author = {Nie, Changhai and Jiang, Jing and Wu, Huayao and Leung, Hareton and Colbourn, Charles J.}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2d512e70839e83d73d09b64dcdb48ecad/dblp}, booktitle = {ICST Workshops}, crossref = {conf/icst/2013w}, ee = {http://doi.ieeecomputersociety.org/10.1109/ICSTW.2013.36}, interhash = {b12e8939c724a8eec65dd19292c6c6c7}, intrahash = {d512e70839e83d73d09b64dcdb48ecad}, isbn = {978-1-4799-1324-4}, keywords = {dblp}, pages = {239-248}, publisher = {IEEE Computer Society}, timestamp = {2016-02-02T15:57:50.000+0100}, title = {Empirically Identifying the Best Greedy Algorithm for Covering Array Generation.}, url = {http://dblp.uni-trier.de/db/conf/icst/icstw2013.html#NieJWLC13}, year = 2013 }