BibTeX record journals/disopt/AazamiCL13

download as .bib file

@article{DBLP:journals/disopt/AazamiCL13,
  author       = {Ashkan Aazami and
                  Joseph Cheriyan and
                  Bundit Laekhanukit},
  title        = {A bad example for the iterative rounding method for mincost k-connected
                  spanning subgraphs},
  journal      = {Discret. Optim.},
  volume       = {10},
  number       = {1},
  pages        = {25--41},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.disopt.2012.10.002},
  doi          = {10.1016/J.DISOPT.2012.10.002},
  timestamp    = {Fri, 12 Feb 2021 13:40:15 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/AazamiCL13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.