@article{DBLP:journals/disopt/CapraraLMM06,
  author    = {Alberto Caprara and
               Andrea Lodi and
               Silvano Martello and
               Michele Monaci},
  title     = {Packing into the smallest square: Worst-case analysis of lower bounds},
  journal   = {Discret. Optim.},
  volume    = {3},
  number    = {4},
  pages     = {317--326},
  year      = {2006},
  url       = {https://doi.org/10.1016/j.disopt.2006.06.001},
  doi       = {10.1016/j.disopt.2006.06.001},
  timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/disopt/CapraraLMM06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"o9wzYdKhRoHRja7mg","bibbaseid":"caprara-lodi-martello-monaci-packingintothesmallestsquareworstcaseanalysisoflowerbounds-2006","authorIDs":["G95oAQQDbf3AqEmTB","KSQdWeDJjGbBo8G2T","WvauJnM2f2MC9dmWt","k7LaJZqXagaznaPKe","waDQsarscgfshSMhZ"],"author_short":["Caprara, A.","Lodi, A.","Martello, S.","Monaci, M."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Alberto"],"propositions":[],"lastnames":["Caprara"],"suffixes":[]},{"firstnames":["Andrea"],"propositions":[],"lastnames":["Lodi"],"suffixes":[]},{"firstnames":["Silvano"],"propositions":[],"lastnames":["Martello"],"suffixes":[]},{"firstnames":["Michele"],"propositions":[],"lastnames":["Monaci"],"suffixes":[]}],"title":"Packing into the smallest square: Worst-case analysis of lower bounds","journal":"Discret. Optim.","volume":"3","number":"4","pages":"317–326","year":"2006","url":"https://doi.org/10.1016/j.disopt.2006.06.001","doi":"10.1016/j.disopt.2006.06.001","timestamp":"Sat, 22 Feb 2020 00:00:00 +0100","biburl":"https://dblp.org/rec/journals/disopt/CapraraLMM06.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/disopt/CapraraLMM06,\n author = {Alberto Caprara and\n Andrea Lodi and\n Silvano Martello and\n Michele Monaci},\n title = {Packing into the smallest square: Worst-case analysis of lower bounds},\n journal = {Discret. Optim.},\n volume = {3},\n number = {4},\n pages = {317--326},\n year = {2006},\n url = {https://doi.org/10.1016/j.disopt.2006.06.001},\n doi = {10.1016/j.disopt.2006.06.001},\n timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/disopt/CapraraLMM06.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Caprara, A.","Lodi, A.","Martello, S.","Monaci, M."],"key":"DBLP:journals/disopt/CapraraLMM06","id":"DBLP:journals/disopt/CapraraLMM06","bibbaseid":"caprara-lodi-martello-monaci-packingintothesmallestsquareworstcaseanalysisoflowerbounds-2006","role":"author","urls":{"Paper":"https://doi.org/10.1016/j.disopt.2006.06.001"},"downloads":0},"bibtype":"article","biburl":"https://dblp.org/pid/196/3740.bib","creationDate":"2020-05-11T16:15:11.423Z","downloads":0,"keywords":[],"search_terms":["packing","smallest","square","worst","case","analysis","lower","bounds","caprara","lodi","martello","monaci"],"title":"Packing into the smallest square: Worst-case analysis of lower bounds","year":2006,"dataSources":["pqA4PfX5cEBnCgHnj"]}