乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T00:39:15Z","timestamp":1649119155752},"reference-count":19,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,10,6]],"date-time":"2019-10-06T00:00:00Z","timestamp":1570320000000},"content-version":"vor","delay-in-days":1466,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003549","name":"Hungarian Scientific Research Fund, OTKA","doi-asserted-by":"publisher","award":["T-81493"],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"crossref","award":["T\u00c1MOP-4.2.2.C-11\/1\/KONV-2012-0004"],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1016\/j.disc.2014.08.007","type":"journal-article","created":{"date-parts":[[2014,8,29]],"date-time":"2014-08-29T21:02:36Z","timestamp":1409346156000},"page":"1714-1721","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximability of the upper chromatic number of hypergraphs"],"prefix":"10.1016","volume":"338","author":[{"given":"Csilla","family":"Bujt\u00e1s","sequence":"first","affiliation":[]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2014.08.007_br000005","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/jgt.3190160405","article-title":"On the minimum size of tight hypergraphs","volume":"16","author":"Arocha","year":"1992","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/j.disc.2014.08.007_br000010","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/jcd.20169","article-title":"Upper chromatic number of finite projective planes","volume":"16","author":"Bacs\u00f3","year":"2008","journal-title":"J. Combin. Des."},{"key":"10.1016\/j.disc.2014.08.007_br000015","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1006\/jagm.1998.0998","article-title":"On the approximation of finding a(nother) Hammiltonian cycle in cubic Hamiltonian graphs","volume":"31","author":"Bazgan","year":"1999","journal-title":"J. Algorithms"},{"key":"10.1016\/j.disc.2014.08.007_br000020","series-title":"Hypergraphs","author":"Berge","year":"1989"},{"key":"10.1016\/j.disc.2014.08.007_br000025","series-title":"Algorithms and Data Structures, 4th International Workshop, WADS\u201995","first-page":"449","article-title":"On approximation properties of the independent set problem for degree 3 graphs","volume":"vol. 955","author":"Berman","year":"1995"},{"key":"10.1016\/j.disc.2014.08.007_br000030","series-title":"Graph Theory","volume":"vol. 244","author":"Bondy","year":"2008"},{"key":"10.1016\/j.disc.2014.08.007_br000035","first-page":"253","article-title":"Voloshin\u2019s conjecture for C-perfect hypertrees","volume":"48","author":"Bujt\u00e1s","year":"2010","journal-title":"Australas. J. Combin."},{"key":"10.1016\/j.disc.2014.08.007_br000040","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s00022-011-0082-2","article-title":"Maximum number of colors: C-coloring and related problems","volume":"101","author":"Bujt\u00e1s","year":"2011","journal-title":"J. Geom."},{"key":"10.1016\/j.disc.2014.08.007_br000045","doi-asserted-by":"crossref","unstructured":"Cs. Bujt\u00e1s, Zs. Tuza, Maximum number of colors in hypertrees of bounded degree, 2013. Manuscript.","DOI":"10.1007\/s10100-014-0357-4"},{"key":"10.1016\/j.disc.2014.08.007_br000050","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","article-title":"A threshold of lnn for approximating set cover","volume":"45","author":"Feige","year":"1998","journal-title":"J. ACM"},{"key":"10.1016\/j.disc.2014.08.007_br000055","doi-asserted-by":"crossref","first-page":"#R19","DOI":"10.37236\/1772","article-title":"On feasible sets of mixed hypergraphs","volume":"11","author":"Kr\u00e1l\u2019","year":"2004","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.disc.2014.08.007_br000060","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1016\/j.dam.2005.05.019","article-title":"Coloring mixed hypertrees","volume":"154","author":"Kr\u00e1l\u2019","year":"2006","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2014.08.007_br000065","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0304-3975(02)00408-5","article-title":"Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs","volume":"295","author":"Kr\u00e1l\u2019","year":"2003","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.disc.2014.08.007_br000070","series-title":"Infinite and Finite Sets, Vol. III, Keszthely 1973, Colloq. Math. Soc. J. Bolyai, vol.~10","first-page":"1387","article-title":"A new combinatorial parameter","author":"Sterboul","year":"1975"},{"key":"10.1016\/j.disc.2014.08.007_br000075","series-title":"Approximation Algorithms","author":"Vazirani","year":"2001"},{"key":"10.1016\/j.disc.2014.08.007_br000080","first-page":"45","article-title":"The mixed hypergraphs","volume":"1","author":"Voloshin","year":"1993","journal-title":"Comput. Sci. J. Moldova"},{"key":"10.1016\/j.disc.2014.08.007_br000085","first-page":"25","article-title":"On the upper chromatic number of a hypergraph","volume":"11","author":"Voloshin","year":"1995","journal-title":"Australas. J. Combin."},{"key":"10.1016\/j.disc.2014.08.007_br000090","series-title":"Coloring Mixed Hypergraphs: Theory, Algorithms and Applications","volume":"vol. 17","author":"Voloshin","year":"2002"},{"key":"10.1016\/j.disc.2014.08.007_br000095","doi-asserted-by":"crossref","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","article-title":"Linear degree extractors and the inapproximability of max clique and chromatic number","volume":"3","author":"Zuckerman","year":"2007","journal-title":"Theory Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X14003203?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X14003203?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T22:14:34Z","timestamp":1598220874000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X14003203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10]]},"references-count":19,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["S0012365X14003203"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2014.08.007","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2015,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximability of the upper chromatic number of hypergraphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2014.08.007","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}