乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T06:41:39Z","timestamp":1720334499934},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1016\/j.ipl.2023.106363","type":"journal-article","created":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T03:56:04Z","timestamp":1674618964000},"page":"106363","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Algorithmic results in Roman dominating functions on graphs"],"prefix":"10.1016","volume":"182","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-2506-0590","authenticated-orcid":false,"given":"Abolfazl","family":"Poureidi","sequence":"first","affiliation":[]},{"given":"Jafar","family":"Fathali","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ipl.2023.106363_br0010","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","article-title":"Some APX-completeness results for cubic graphs","volume":"237","author":"Alimonti","year":"2000","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ipl.2023.106363_br0020","first-page":"205","article-title":"Dominating sets in chordal graphs","volume":"9","author":"Booth","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ipl.2023.106363_br0030","doi-asserted-by":"crossref","first-page":"1264","DOI":"10.1016\/j.ic.2008.07.003","article-title":"Approximation hardness of dominating set problems in bounded degree graphs","volume":"206","author":"Chleb\u00edk","year":"2008","journal-title":"Inf. Comput."},{"key":"10.1016\/j.ipl.2023.106363_br0040","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.disc.2003.06.004","article-title":"Roman domination in graphs","volume":"278","author":"Cockayne","year":"2004","journal-title":"Discrete Math."},{"key":"10.1016\/j.ipl.2023.106363_br0050","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1287\/moor.7.4.515","article-title":"Worst-case analysis of greedy heuristics for integer programming with nonnegative data","volume":"7","author":"Dobson","year":"1982","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.ipl.2023.106363_br0060","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.ipl.2023.106363_br0070","doi-asserted-by":"crossref","first-page":"51","DOI":"10.2298\/PIM1613051I","article-title":"Improved mixed integer linear programing formulations for Roman domination problem","volume":"99","author":"Ivanovi\u0107","year":"2016","journal-title":"Publ. Inst. Math."},{"key":"10.1016\/j.ipl.2023.106363_br0080","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0166-218X(93)90178-Q","article-title":"The complexity of domination problems in circle graphs","volume":"42","author":"Keil","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ipl.2023.106363_br0090","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1007\/s10878-012-9482-y","article-title":"Roman domination on strongly chordal graphs","volume":"26","author":"Liu","year":"2013","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.ipl.2023.106363_br0100","doi-asserted-by":"crossref","first-page":"3400","DOI":"10.1016\/j.dam.2008.01.011","article-title":"Efficient algorithms for Roman domination on some classes of graphs","volume":"156","author":"Liedloff","year":"2008","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ipl.2023.106363_br0110","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s12190-020-01345-4","article-title":"Algorithmic aspects of Roman domination in graphs","volume":"64","author":"Padamutham","year":"2020","journal-title":"J. Appl. Math. Comput."},{"key":"10.1016\/j.ipl.2023.106363_br0120","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019023000066?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019023000066?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T11:36:14Z","timestamp":1684236974000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019023000066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":12,"alternative-id":["S0020019023000066"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2023.106363","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2023,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Algorithmic results in Roman dominating functions on graphs","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2023.106363","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"106363"}}