%% ToC Vol 2 article 3 .bib file

@InProceedings{bartal:focs-96,
  author =       "Yair Bartal",
  booktitle =    "Proceedings of the 37th Annual IEEE Symposium on Foundations
  of Computer Science",
  title =        "Probabilistic Approximations of Metric Spaces and its
                 Algorithmic Applications",
  pages =        "184--193",
  year =         "1996",
  eprint =       {focs:10.1109/SFCS.1996.548477}
}

@InProceedings{CCGG98,
  author =       "Moses Charikar and Chandra Chekuri and Ashish Goel and
                 Sudipto Guha",
  booktitle =    {Proceedings of the 30th Annual Symposium on the Theory of Computing},
  title =        "Rounding via trees: deterministic approximation
                 algorithms for group {Steiner} trees and $k$ median",
  pages =        "114--123",
  year =         "1998",
  eprint =       {stoc:10.1145/276698.276719}
}

@article {evenetal:manuscript-01,
    AUTHOR = {Even, Guy and Kortsarz, Guy and Slany, Wolfgang},
     TITLE = {On network design problems: fixed cost flows and the covering
              {S}teiner problem},
   JOURNAL = {ACM Trans. Algorithms},
  FJOURNAL = {ACM Transactions on Algorithms},
    VOLUME = {1},
      YEAR = {2005},
    NUMBER = {1},
     PAGES = {74--101},
      ISSN = {1549-6325},
   MRCLASS = {68R10 (05C85 68Q25 68W25 90B10)},
  MRNUMBER = {MR2163131},
  eprint   = {talg:10.1145/1077464.1077470}
}

@article {fak-rao-tal,
    AUTHOR = {Fakcharoenphol, Jittat and Rao, Satish and Talwar, Kunal},
     TITLE = {A tight bound on approximating arbitrary metrics by tree
              metrics},
   JOURNAL = {J. Comput. System Sci.},
  FJOURNAL = {Journal of Computer and System Sciences},
    VOLUME = {69},
      YEAR = {2004},
    NUMBER = {3},
     PAGES = {485--497},
      ISSN = {0022-0000},
     CODEN = {JCSSBM},
   MRCLASS = {05C10 (68R10 68W25)},
  MRNUMBER = {MR2087946 (2005h:05056)},
MRREVIEWER = {A. Vijayakumar},
    EPRINT = {jcss:10.1016/j.jcss.2004.04.011}
}

@Article{gargetal:soda-98,
  author =       "Naveen Garg and Goran Konjevod and R. Ravi",
  title =        "A polylogarithmic approximation algorithm for the
                 group {Steiner} tree problem",
  journal =      "Journal of Algorithms",
  volume =       "37",
  number =       "1",
  pages =        "66--84",
  year =         "2000",
  eprint =       {JAlg:10.1006/jagm.2000.1096}
}

@InProceedings{hkksw,
  author =       "Eran Halperin and Guy Kortsarz and Robert Krauthgamer
                 and Aravind Srinivasan and Nan Wang",
  booktitle =    "14th Annual ACM-SIAM Symposium on Discrete
                 Algorithms",
  title =        "Integrality ratio for Group {Steiner} Trees and
                 Directed {Steiner} Trees",
  pages =        "275--284",
  month =        Jan,
  year =         "2003",
  eprint =       {soda:644108.644155}
}

@InProceedings{halp-krau-polylog,
  author =       "Eran Halperin and Robert Krauthgamer",
  booktitle =    "Proceedings of the thirty-fifth ACM symposium on
                 Theory of computing",
  title =        "Polylogarithmic inapproximability",
  publisher =    "ACM Press",
  pages =        "585--594",
  year =         "2003",
  ISBN =         "1-58113-674-9",
  location =     "San Diego, CA, USA",
  eprint =       {stoc:10.1145/780542.780628}
}

@article {janson:rsa-90,
    AUTHOR = {Janson, Svante},
     TITLE = {Poisson approximation for large deviations},
   JOURNAL = {Random Structures and Algorithms},
  FJOURNAL = {Random Structures and Algorithms},
    VOLUME = {1},
      YEAR = {1990},
    NUMBER = {2},
     PAGES = {221--229},
      ISSN = {1042-9832},
   MRCLASS = {60F10 (05C80 60C05)},
  MRNUMBER = {MR1138428 (93a:60041)},
MRREVIEWER = {Andrew D. Barbour},
}

@article {krs:cov-stei,
    AUTHOR = {Konjevod, Goran and Ravi, R. and Srinivasan, Aravind},
     TITLE = {Approximation algorithms for the covering {S}teiner problem},
      NOTE = {Special Issue on \textit{Probabilistic methods in combinatorial optimization}},
   JOURNAL = {Random Structures and Algorithms},
  FJOURNAL = {Random Structures and Algorithms},
    VOLUME = {20},
      YEAR = {2002},
    NUMBER = {3},
     PAGES = {465--482},
      ISSN = {1042-9832},
   MRCLASS = {90C35 (05C05 05C85)},
  MRNUMBER = {MR1900617 (2003c:90125)},
    EPRINT = {RSA:10.1002/rsa.10038}
}

@inproceedings {srinivasan:soda-01,
    AUTHOR = {Srinivasan, Aravind},
     TITLE = {New approaches to covering and packing problems},
 BOOKTITLE = {Proceedings of the Twelfth Annual ACM-SIAM Symposium on
              Discrete Algorithms (Washington, DC, 2001)},
     PAGES = {567--576},
 PUBLISHER = {SIAM},
   ADDRESS = {Philadelphia, PA},
      YEAR = {2001},
   MRCLASS = {68W25 (90B80 90C27)},
  MRNUMBER = {MR1958450},
    EPRINT = {soda:365411.365535}
}

@PhdThesis{Khandekar,
  author = 	 {Rohit Khandekar},
  title = 	 {Lagrangian Relaxation based Algorithms for Convex Programming Problems},
  school = 	 {Indian Institute of Technology, New Delhi},
  year = 	 2004,
  month =	 {March}
}

@inproceedings{Garg05,
  author    = {Naveen Garg},
  title     = {Saving an epsilon: a 2-approximation for the k-MST problem
               in graphs.},
  booktitle     = {Proceedings of the 37th Annual ACM Symposium on Theory of
               Computing, Baltimore, MD, USA, May 22-24, 2005},
  year      = 2005,
  pages     = {396-402},
  eprint    = {stoc:10.1145/1060590.1060650},
}