乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T03:28:27Z","timestamp":1719890907532},"reference-count":33,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T00:00:00Z","timestamp":1409529600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1016\/j.jctb.2014.02.011","type":"journal-article","created":{"date-parts":[[2014,3,22]],"date-time":"2014-03-22T03:13:11Z","timestamp":1395457991000},"page":"40-80","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope"],"prefix":"10.1016","volume":"108","author":[{"given":"M.","family":"E.-Nagy","sequence":"first","affiliation":[]},{"given":"M.","family":"Laurent","sequence":"additional","affiliation":[]},{"given":"A.","family":"Varvitsiotis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jctb.2014.02.011_br0010","first-page":"486","article-title":"Quadratic forms on graphs","volume":"163","author":"Alon","year":"2005","journal-title":"Invent. Math."},{"key":"10.1016\/j.jctb.2014.02.011_br0020","series-title":"APPROX and RANDOM 2005","first-page":"14","article-title":"Rounding two and three dimensional solutions of the SDP relaxation of max cut","volume":"vol. 3624","author":"Avidor","year":"2005"},{"key":"10.1016\/j.jctb.2014.02.011_br0030","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s00454-006-1285-4","article-title":"Realizability of graphs in three dimensions","volume":"37","author":"Belk","year":"2007","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.jctb.2014.02.011_br0040","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s00454-006-1284-5","article-title":"Realizability of graphs","volume":"37","author":"Belk","year":"2007","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.jctb.2014.02.011_br0050","series-title":"Grothendieck inequalities, nonlocal games and optimization","author":"Bri\u00ebt","year":"2012"},{"key":"10.1016\/j.jctb.2014.02.011_br0060","author":"Bri\u00ebt"},{"issue":"2","key":"10.1016\/j.jctb.2014.02.011_br0070","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1006\/jctb.1998.1834","article-title":"Multiplicities of eigenvalues and tree-width of graphs","volume":"74","author":"Colin de Verdi\u00e8re","year":"1998","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.jctb.2014.02.011_br0080","series-title":"Geometry of Cuts and Metrics","author":"Deza","year":"1997"},{"key":"10.1016\/j.jctb.2014.02.011_br0090","article-title":"Graph Theory","volume":"vol. 173","author":"Diestel","year":"1997"},{"key":"10.1016\/j.jctb.2014.02.011_br0100","series-title":"Discrete Geometry and Optimization","article-title":"Complexity of the positive semidefinite matrix completion problem with a rank constraint","volume":"vol. 69","author":"E.-Nagy","year":"2013"},{"key":"10.1016\/j.jctb.2014.02.011_br0110","series-title":"Approximation Algorithms and Semidefinite Programming","author":"G\u00e4rtner","year":"2012"},{"key":"10.1016\/j.jctb.2014.02.011_br0120","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","article-title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming","volume":"42","author":"Goemans","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/j.jctb.2014.02.011_br0130","first-page":"1","article-title":"R\u00e9sum\u00e9 de la th\u00e9orie m\u00e9trique des produits tensoriels topologiques","volume":"8","author":"Grothendieck","year":"1953","journal-title":"Bol. Soc. Mat. Sao Paolo"},{"key":"10.1016\/j.jctb.2014.02.011_br0140","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1988"},{"issue":"1","key":"10.1016\/j.jctb.2014.02.011_br0160","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1137\/S0097539705447372","article-title":"Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?","volume":"37","author":"Khot","year":"2007","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.jctb.2014.02.011_br0170","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s004930070038","article-title":"Spectral characterization of tree-width-two graphs","volume":"20","author":"Kotlov","year":"2000","journal-title":"Combinatorica"},{"key":"10.1016\/j.jctb.2014.02.011_br0180","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0012-365X(00)00102-3","article-title":"Tree width and regular triangulations","volume":"237","author":"Kotlov","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/j.jctb.2014.02.011_br0190","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0024-3795(95)00741-5","article-title":"The real positive semidefinite completion problem for series-parallel graphs","volume":"252","author":"Laurent","year":"1997","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.jctb.2014.02.011_br0200","series-title":"Emerging Applications of Algebraic Geometry, vol. 149","first-page":"157","article-title":"Sums of squares, moment matrices and optimization over polynomials","author":"Laurent","year":"2009"},{"issue":"3","key":"10.1016\/j.jctb.2014.02.011_br0210","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1137\/0617031","article-title":"On the facial structure of the set of correlation matrices","volume":"17","author":"Laurent","year":"1996","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.jctb.2014.02.011_br0230","author":"Laurent"},{"key":"10.1016\/j.jctb.2014.02.011_br0220","doi-asserted-by":"crossref","unstructured":"M. Laurent, A. Varvitsiotis, A new graph parameter related to bounded rank positive semidefinite matrix completions, Math. Program. Ser. A, http:\/\/dx.doi.org\/10.1007\/s10107-013-0648-x, Published online 2013.","DOI":"10.1007\/s10107-013-0648-x"},{"issue":"3","key":"10.1016\/j.jctb.2014.02.011_br0240","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1137\/S0895479892240683","article-title":"A note on extreme correlation matrices","volume":"15","author":"Li","year":"1994","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.jctb.2014.02.011_br0270","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","article-title":"On the Shanon capacity of graphs","volume":"25","author":"Lov\u00e1sz","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.jctb.2014.02.011_br0250","author":"Lov\u00e1sz"},{"key":"10.1016\/j.jctb.2014.02.011_br0260","author":"Lov\u00e1sz"},{"key":"10.1016\/j.jctb.2014.02.011_br0280","series-title":"Paul Erd\u0151s and His Mathematics","first-page":"471","article-title":"Geometric representations of graphs","author":"Lov\u00e1sz","year":"2002"},{"key":"10.1016\/j.jctb.2014.02.011_br0290","series-title":"Proc. 38th ACM STOC","first-page":"205","article-title":"Near-optimal algorithms for unique games","author":"Makarychev","year":"2006"},{"issue":"2\u20133","key":"10.1016\/j.jctb.2014.02.011_br0300","doi-asserted-by":"crossref","first-page":"307","DOI":"10.3166\/ejc.9.307-321","article-title":"Semidefinite programming relaxations and algebraic optimization in control","volume":"9","author":"Parrilo","year":"2003","journal-title":"Eur. J. Control"},{"issue":"2","key":"10.1016\/j.jctb.2014.02.011_br0310","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","article-title":"Graph minors. XX. Wagner's conjecture","volume":"92","author":"Robertson","year":"2004","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.jctb.2014.02.011_br0320","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1103\/PhysRev.176.718","article-title":"Spherical model as the limit of infinite spin dimensionality","volume":"176","author":"Stanley","year":"1968","journal-title":"Phys. Rev."},{"key":"10.1016\/j.jctb.2014.02.011_br0330","series-title":"Topological and spectral graph characterizations","author":"van der Holst","year":"1996"},{"issue":"4","key":"10.1016\/j.jctb.2014.02.011_br0340","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1007\/s00493-003-0038-8","article-title":"Two tree-width-like graph invariants","volume":"23","author":"van der Holst","year":"2003","journal-title":"Combinatorica"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895614000367?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895614000367?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T21:23:00Z","timestamp":1538774580000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895614000367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":33,"alternative-id":["S0095895614000367"],"URL":"https:\/\/doi.org\/10.1016\/j.jctb.2014.02.011","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2014,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series B","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jctb.2014.02.011","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}