%0 Conference Paper %1 conf/approx/AazamiCJ09 %A Aazami, Ashkan %A Cheriyan, Joseph %A Jampani, Krishnam Raju %B APPROX-RANDOM %D 2009 %E Dinur, Irit %E Jansen, Klaus %E Naor, Joseph %E Rolim, José D. P. %I Springer %K %P 1-14 %T Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. %U http://dblp.uni-trier.de/db/conf/approx/approx2009.html#AazamiCJ09 %V 5687 %@ 978-3-642-03684-2

@inproceedings{conf/approx/AazamiCJ09, added-at = {2023-12-13T01:03:14.000+0100}, author = {Aazami, Ashkan and Cheriyan, Joseph and Jampani, Krishnam Raju}, biburl = {https://www.bibsonomy.org/bibtex/2d9a9ce3db002eaf658e8464a8b7ab275/admin}, booktitle = {APPROX-RANDOM}, crossref = {conf/approx/2009}, editor = {Dinur, Irit and Jansen, Klaus and Naor, Joseph and Rolim, José D. P.}, ee = {https://doi.org/10.1007/978-3-642-03685-9_1}, interhash = {6c2bb1b0835024cc482a793f13532541}, intrahash = {d9a9ce3db002eaf658e8464a8b7ab275}, isbn = {978-3-642-03684-2}, keywords = {}, pages = {1-14}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2023-12-13T01:03:14.000+0100}, title = {Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs.}, url = {http://dblp.uni-trier.de/db/conf/approx/approx2009.html#AazamiCJ09}, volume = 5687, year = 2009 }