{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:09Z","timestamp":1759638909908,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,7,20]],"date-time":"2016-07-20T00:00:00Z","timestamp":1468972800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100009226","name":"National Security Agency","doi-asserted-by":"publisher","award":["H98230-15-1-0013"],"award-info":[{"award-number":["H98230-15-1-0013"]}],"id":[{"id":"10.13039\/100009226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10878-016-0060-6","type":"journal-article","created":{"date-parts":[[2016,7,20]],"date-time":"2016-07-20T02:51:15Z","timestamp":1468983075000},"page":"114-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Modified linear programming and class 0 bounds for graph pebbling"],"prefix":"10.1007","volume":"34","author":[{"given":"Daniel W.","family":"Cranston","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luke","family":"Postle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenxiao","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carl","family":"Yerger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"60_CR1","unstructured":"Blasiak A, Czygrinow A, Fu A, Herscovici D, Hurlbert G, Schmitt JR (2012) Sparse graphs with small pebbling number. Manuscript"},{"key":"60_CR2","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1002\/jgt.20187","volume":"52","author":"B Bukh","year":"2006","unstructured":"Bukh B (2006) Maximum pebbling number of graphs of diameter three. J Graph Theory 52:353\u2013357","journal-title":"J Graph Theory"},{"key":"60_CR3","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1137\/0402041","volume":"2","author":"F Chung","year":"1989","unstructured":"Chung F (1989) Pebbling in hypercubes. SIAM J Discrete Math 2:467\u2013472","journal-title":"SIAM J Discrete Math"},{"key":"60_CR4","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1137\/050636218","volume":"20","author":"B Clark","year":"2006","unstructured":"Clark B, Milans K (2006) The complexity of graph pebbling. SIAM J Discrete Math 20:769\u2013798","journal-title":"SIAM J Discrete Math"},{"key":"60_CR5","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1002\/(SICI)1097-0118(199706)25:2<119::AID-JGT3>3.0.CO;2-P","volume":"25","author":"TA Clarke","year":"1997","unstructured":"Clarke TA, Hochberg RA, Hurlbert GH (1997) Pebbling in diameter two graphs and products of paths. J Graph Theory 25:119\u2013128","journal-title":"J Graph Theory"},{"key":"60_CR6","first-page":"41","volume":"10F","author":"P Erd\u0151s","year":"1961","unstructured":"Erd\u0151s P, Ginzburg A, Ziv A (1961) A theorem in additive number theory. Bull Res Council Isr 10F:41\u201343","journal-title":"Bull Res Council Isr"},{"key":"60_CR7","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1007\/BF02880130","volume":"44","author":"R Feng","year":"2001","unstructured":"Feng R, Kim JY (2001) Graham\u2019s pebbling conjecture on product of complete bipartite graphs. Sci China Ser A 44:817\u2013822","journal-title":"Sci China Ser A"},{"key":"60_CR8","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1007\/BF02872335","volume":"45","author":"R Feng","year":"2002","unstructured":"Feng R, Kim JY (2002) Pebbling numbers of some graphs. Sci China Ser A 45:470\u2013478","journal-title":"Sci China Ser A"},{"key":"60_CR9","volume-title":"Graph theory and its applications","author":"JL Gross","year":"2006","unstructured":"Gross JL, Yellen J, Zhang P (2006) Graph theory and its applications, 2nd edn. Chapman & Hall\/CRC, Boca Raton","edition":"2"},{"key":"60_CR10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/jgt.10080","volume":"42","author":"D Herscovici","year":"2003","unstructured":"Herscovici D (2003) Graham\u2019s pebbling conjecture on products of cycles. J Graph Theory 42:141\u2013154","journal-title":"J Graph Theory"},{"key":"60_CR11","doi-asserted-by":"crossref","first-page":"6501","DOI":"10.1016\/j.disc.2007.12.045","volume":"308","author":"DS Herscovici","year":"2008","unstructured":"Herscovici DS (2008) Graham\u2019s pebbling conjecture on products of many cycles. Discrete Math 308:6501\u20136512","journal-title":"Discrete Math"},{"key":"60_CR12","unstructured":"Hurlbert G (2011) A linear optimization technique for graph pebbling. Preprint, available at: \n                        arXiv:1101.5641"},{"key":"60_CR13","first-page":"41","volume":"139","author":"G Hurlbert","year":"1999","unstructured":"Hurlbert G (1999) A survey of graph pebbling. Congr Numer 139:41\u201364","journal-title":"Congr Numer"},{"key":"60_CR14","first-page":"25","volume":"XLIX","author":"G Hurlbert","year":"2005","unstructured":"Hurlbert G (2005) Recent progress in graph pebbling. Graph Theory Notes New York XLIX:25\u201337","journal-title":"Graph Theory Notes New York"},{"key":"60_CR15","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0022-314X(89)90077-2","volume":"31","author":"P Lemke","year":"1989","unstructured":"Lemke P, Kleitman D (1989) An addition theorem on the integers modulo \n                        $$n$$\n                        \n                            \n                                            \n                                n\n                            \n                        \n                    . J Number Theory 31:335\u2013345","journal-title":"J Number Theory"},{"key":"60_CR16","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0095-8956(92)90043-W","volume":"55","author":"D Moews","year":"1992","unstructured":"Moews D (1992) Pebbling graphs. J Comb Theory Ser B 55:244\u2013252","journal-title":"J Comb Theory Ser B"},{"key":"60_CR17","unstructured":"Pachter L, Snevily HS, Voxman B (1995) On pebbling graphs. Proccedings of the Twenty-Sixth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1995), vol. 107, pp. 65\u201380"},{"key":"60_CR18","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1002\/jgt.21736","volume":"75","author":"L Postle","year":"2014","unstructured":"Postle L (2014) Pebbling graphs of fixed diameter. J Graph Theory 75:302\u2013310","journal-title":"J Graph Theory"},{"key":"60_CR19","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1002\/jgt.21648","volume":"72","author":"L Postle","year":"2013","unstructured":"Postle L, Streib N, Yerger C (2013) Pebbling graphs of diameter three and four. J Graph Theory 72:398\u2013417","journal-title":"J Graph Theory"},{"key":"60_CR20","unstructured":"Watson N (2005) The complexity of pebbling and cover pebbling. Preprint, available at: \n                        arXiv:math\/0503511"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0060-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0060-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0060-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0060-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,9]],"date-time":"2017-06-09T03:11:23Z","timestamp":1496977883000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0060-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,20]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["60"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0060-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2016,7,20]]}}}