%0 Conference Paper %1 conf/approx/NagarajanR05 %A Nagarajan, Viswanath %A Ravi, R. %B APPROX-RANDOM %D 2005 %E Chekuri, Chandra %E Jansen, Klaus %E Rolim, José D. P. %E Trevisan, Luca %I Springer %K dblp %P 209-220 %T Approximation Algorithms for Requirement Cut on Graphs. %U http://dblp.uni-trier.de/db/conf/approx/approx2005.html#NagarajanR05 %V 3624 %@ 3-540-28239-4

@inproceedings{conf/approx/NagarajanR05, added-at = {2017-05-23T00:00:00.000+0200}, author = {Nagarajan, Viswanath and Ravi, R.}, biburl = {https://www.bibsonomy.org/bibtex/2c8d784c915b99ddcf0c6b7f643a8abcc/dblp}, booktitle = {APPROX-RANDOM}, crossref = {conf/approx/2005}, editor = {Chekuri, Chandra and Jansen, Klaus and Rolim, José D. P. and Trevisan, Luca}, ee = {https://doi.org/10.1007/11538462_18}, interhash = {dfbf7a5ed31c304a28a269140499329b}, intrahash = {c8d784c915b99ddcf0c6b7f643a8abcc}, isbn = {3-540-28239-4}, keywords = {dblp}, pages = {209-220}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T00:33:57.000+0200}, title = {Approximation Algorithms for Requirement Cut on Graphs.}, url = {http://dblp.uni-trier.de/db/conf/approx/approx2005.html#NagarajanR05}, volume = 3624, year = 2005 }