@article{journals/cc/ChawlaKKRS06,
  added-at = {2020-03-15T00:00:00.000+0100},
  author = {Chawla, Shuchi and Krauthgamer, Robert and Kumar, Ravi and Rabani, Yuval and Sivakumar, D.},
  biburl = {https://www.bibsonomy.org/bibtex/295108ab3f654b66ad9dc8b9133eda572/dblp},
  ee = {https://doi.org/10.1007/s00037-006-0210-9},
  interhash = {5af59c2fcd0102c1113372f3a6add865},
  intrahash = {95108ab3f654b66ad9dc8b9133eda572},
  journal = {Comput. Complex.},
  keywords = {dblp},
  number = 2,
  pages = {94-114},
  timestamp = {2020-03-17T11:40:00.000+0100},
  title = {On the Hardness of Approximating Multicut and Sparsest-Cut.},
  url = {http://dblp.uni-trier.de/db/journals/cc/cc15.html#ChawlaKKRS06},
  volume = 15,
  year = 2006
}

{"_id":"svSJZeMF7hJuTzP77","bibbaseid":"chawla-krauthgamer-kumar-rabani-sivakumar-onthehardnessofapproximatingmulticutandsparsestcut-2006","author_short":["Chawla, S.","Krauthgamer, R.","Kumar, R.","Rabani, Y.","Sivakumar, D."],"bibdata":{"bibtype":"article","type":"article","added-at":"2020-03-15T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Chawla"],"firstnames":["Shuchi"],"suffixes":[]},{"propositions":[],"lastnames":["Krauthgamer"],"firstnames":["Robert"],"suffixes":[]},{"propositions":[],"lastnames":["Kumar"],"firstnames":["Ravi"],"suffixes":[]},{"propositions":[],"lastnames":["Rabani"],"firstnames":["Yuval"],"suffixes":[]},{"propositions":[],"lastnames":["Sivakumar"],"firstnames":["D."],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/295108ab3f654b66ad9dc8b9133eda572/dblp","ee":"https://doi.org/10.1007/s00037-006-0210-9","interhash":"5af59c2fcd0102c1113372f3a6add865","intrahash":"95108ab3f654b66ad9dc8b9133eda572","journal":"Comput. Complex.","keywords":"dblp","number":"2","pages":"94-114","timestamp":"2020-03-17T11:40:00.000+0100","title":"On the Hardness of Approximating Multicut and Sparsest-Cut.","url":"http://dblp.uni-trier.de/db/journals/cc/cc15.html#ChawlaKKRS06","volume":"15","year":"2006","bibtex":"@article{journals/cc/ChawlaKKRS06,\n added-at = {2020-03-15T00:00:00.000+0100},\n author = {Chawla, Shuchi and Krauthgamer, Robert and Kumar, Ravi and Rabani, Yuval and Sivakumar, D.},\n biburl = {https://www.bibsonomy.org/bibtex/295108ab3f654b66ad9dc8b9133eda572/dblp},\n ee = {https://doi.org/10.1007/s00037-006-0210-9},\n interhash = {5af59c2fcd0102c1113372f3a6add865},\n intrahash = {95108ab3f654b66ad9dc8b9133eda572},\n journal = {Comput. Complex.},\n keywords = {dblp},\n number = 2,\n pages = {94-114},\n timestamp = {2020-03-17T11:40:00.000+0100},\n title = {On the Hardness of Approximating Multicut and Sparsest-Cut.},\n url = {http://dblp.uni-trier.de/db/journals/cc/cc15.html#ChawlaKKRS06},\n volume = 15,\n year = 2006\n}\n\n","author_short":["Chawla, S.","Krauthgamer, R.","Kumar, R.","Rabani, Y.","Sivakumar, D."],"key":"journals/cc/ChawlaKKRS06","id":"journals/cc/ChawlaKKRS06","bibbaseid":"chawla-krauthgamer-kumar-rabani-sivakumar-onthehardnessofapproximatingmulticutandsparsestcut-2006","role":"author","urls":{"Link":"https://doi.org/10.1007/s00037-006-0210-9","Paper":"http://dblp.uni-trier.de/db/journals/cc/cc15.html#ChawlaKKRS06"},"keyword":["dblp"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/ravi Kumar?items=1000","dataSources":["DiSHMj5oiLBLaqrYP"],"keywords":["dblp"],"search_terms":["hardness","approximating","multicut","sparsest","cut","chawla","krauthgamer","kumar","rabani","sivakumar"],"title":"On the Hardness of Approximating Multicut and Sparsest-Cut.","year":2006}