{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:17:09Z","timestamp":1720052229349},"reference-count":43,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,3,1]],"date-time":"2014-03-01T00:00:00Z","timestamp":1393632000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,3,11]],"date-time":"2018-03-11T00:00:00Z","timestamp":1520726400000},"content-version":"vor","delay-in-days":1471,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1016\/j.dam.2013.05.015","type":"journal-article","created":{"date-parts":[[2013,6,17]],"date-time":"2013-06-17T11:02:15Z","timestamp":1371466935000},"page":"37-48","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":30,"special_numbering":"C","title":["The maximum vertex coverage problem on bipartite graphs"],"prefix":"10.1016","volume":"165","author":[{"given":"Nicola","family":"Apollonio","sequence":"first","affiliation":[]},{"given":"Bruno","family":"Simeone","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2013.05.015_br000005","first-page":"17","article-title":"Approximation algorithms for maximum coverage and max cut with given sizes of parts","volume":"vol. 1610","author":"Ageev","year":"1999"},{"issue":"11","key":"10.1016\/j.dam.2013.05.015_br000010","doi-asserted-by":"crossref","first-page":"1166","DOI":"10.1016\/j.dam.2011.02.008","article-title":"Recognizing Helly edge-path-tree graphs and their clique graphs","volume":"159","author":"Apollonio","year":"2011","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.dam.2013.05.015_br000015","first-page":"388","article-title":"Minsquare factors and maxfix covers of graphs","volume":"vol. 3064","author":"Apollonio","year":"2004"},{"key":"10.1016\/j.dam.2013.05.015_br000020","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1137\/060651136","article-title":"Minconvex factors of prescribed size in graphs","volume":"23","author":"Apollonio","year":"2009","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10.1016\/j.dam.2013.05.015_br000025","series-title":"Hypergraphes, Combinatoire des Ensembles Finis","author":"Berge","year":"1987"},{"key":"10.1016\/j.dam.2013.05.015_br000030","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0012-365X(89)90193-3","article-title":"A minimax relations for the partial q-colorings of a graph","volume":"74","author":"Berge","year":"1989","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.dam.2013.05.015_br000035","first-page":"205","article-title":"The q-perfect graphs-2","volume":"47","author":"Berge","year":"1992","journal-title":"Le Matematiche"},{"key":"10.1016\/j.dam.2013.05.015_br000040","series-title":"Graph Classes: A Survey","author":"Brandst\u00e4dt","year":"1999"},{"issue":"6","key":"10.1016\/j.dam.2013.05.015_br000045","doi-asserted-by":"crossref","first-page":"1740","DOI":"10.1137\/080733991","article-title":"Maximizing a submodular set function subject to a matroid constraint","volume":"40","author":"Calinescu","year":"2011","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.dam.2013.05.015_br000050","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0012-365X(89)90194-5","article-title":"A min\u2013max relation for the partial q-colourings of a graph. part II: box perfection","volume":"74","author":"Cameron","year":"1989","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.dam.2013.05.015_br000055","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0166-218X(88)90086-8","article-title":"The complexity of generalized clique covering","volume":"22","author":"Corneil","year":"1988","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.dam.2013.05.015_br000060","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0166-218X(84)90088-X","article-title":"Clustering and domination in perfect graphs","volume":"9","author":"Corneil","year":"1984","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.dam.2013.05.015_br000065","series-title":"Combinatorial Optimization. Packing and Covering","author":"Cornuejols","year":"2001"},{"key":"10.1016\/j.dam.2013.05.015_br000070","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","article-title":"Location of bank accounts to optimize float: an analytic study exact and approximation algorithms","volume":"23","author":"Cornuejols","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/j.dam.2013.05.015_br000075","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1287\/opre.28.4.847","article-title":"Worst-case and probabilistic analysis of algorithms for a location problem","volume":"28","author":"Cornuejols","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/j.dam.2013.05.015_br000080","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0020-0190(98)00019-2","article-title":"Maximum h-colourable subgraph problem in balanced graphs","volume":"65","author":"Dahlhaus","year":"1998","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.dam.2013.05.015_br000085","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1016\/j.tcs.2005.09.037","article-title":"(p,q)-coloring problems in line graphs","volume":"349","author":"Demange","year":"2005","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.dam.2013.05.015_br000090","series-title":"Handbook of Combinatorics","first-page":"381","article-title":"Hypergraphs","author":"Duchet","year":"1995"},{"key":"10.1016\/j.dam.2013.05.015_br000095","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","article-title":"A min\u2013max relation for submodular functions on graphs","volume":"1","author":"Edmonds","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/j.dam.2013.05.015_br000100","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterizations of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.dam.2013.05.015_br000105","series-title":"On the densest k-subgraph problem, The Weizmann Institute, Rehovot, Tech. Rep.","author":"Feige","year":"1997"},{"key":"10.1016\/j.dam.2013.05.015_br000110","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/0095-8956(80)90079-9","article-title":"On chain and antichain families of a partially ordered set","volume":"29","author":"Frank","year":"1980","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"10.1016\/j.dam.2013.05.015_br000115","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.orl.2005.03.006","article-title":"Improved approximation of maximum vertex cover","volume":"34","author":"Galluccio","year":"2006","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.dam.2013.05.015_br000120","series-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.dam.2013.05.015_br000125","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","article-title":"The intersection graphs of subtrees in trees are exactly the chordal graphs","volume":"16","author":"Gavril","year":"1974","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"10.1016\/j.dam.2013.05.015_br000130","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1002\/net.3230170407","article-title":"Algorithms for maximum k-colorings and k-coverings of transitive graphs","volume":"17","author":"Gavril","year":"1987","journal-title":"Networks"},{"key":"10.1016\/j.dam.2013.05.015_br000135","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/j.dam.2013.05.015_br000140","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1988"},{"key":"10.1016\/j.dam.2013.05.015_br000145","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/S0377-2217(02)00330-2","article-title":"On approximation of max-vertex cover","volume":"143","author":"Han","year":"2002","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.dam.2013.05.015_br000150","series-title":"Approximation Algorithms for NP-Hard Problems","article-title":"Approximating covering and packing problems: set cover, vertex cover, independent and related problems","author":"Hochbaum","year":"1997"},{"key":"10.1016\/j.dam.2013.05.015_br000155","first-page":"319","article-title":"Maximum covering with D cliques","volume":"vol. 710","author":"Jansen","year":"1993"},{"key":"10.1016\/j.dam.2013.05.015_br000160","unstructured":"G. Joret, A. Vetta, Reducing the rank of a matroid, 2012. arXiv:1211.4853."},{"key":"10.1016\/j.dam.2013.05.015_br000165","first-page":"468","article-title":"A unified approach to approximating partial covering problems","volume":"vol. 4168","author":"K\u00f6nemann","year":"2006"},{"issue":"3","key":"10.1016\/j.dam.2013.05.015_br000170","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","article-title":"Normal hypergraphs and the perfect graph conjecture","volume":"2","author":"Lov\u00e1sz","year":"1972","journal-title":"Discrete Mathematics"},{"issue":"2","key":"10.1016\/j.dam.2013.05.015_br000175","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0095-8956(72)90045-7","article-title":"A characterization of perfect graphs","volume":"13","author":"Lov\u00e1sz","year":"1972","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"10.1016\/j.dam.2013.05.015_br000180","series-title":"Matching Theory","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/j.dam.2013.05.015_br000185","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/j.dam.2013.05.015_br000190","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","article-title":"An analysis of approximations for maximizing submodular set functions-i","volume":"14","author":"Nemhauser","year":"1978","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.dam.2013.05.015_br000195","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1998"},{"key":"10.1016\/j.dam.2013.05.015_br000200","series-title":"Combinatorial Optimization. Polyhedra and Efficiency","author":"Schrijver","year":"2003"},{"key":"10.1016\/j.dam.2013.05.015_br000205","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1016\/j.jctb.2006.09.005","article-title":"Minmax relations for cyclically ordered digraphs","volume":"97","author":"Seb\u0151","year":"2007","journal-title":"Journal of Combinatorial Theory. Series B"},{"key":"10.1016\/j.dam.2013.05.015_br000210","series-title":"NP-hardness of k-sparsest subgraph in chordal graphs, Laboratoire LIRMM Montpellier, Tech. Rep. N. RR-12026","author":"Watrigant","year":"2012"},{"key":"10.1016\/j.dam.2013.05.015_br000215","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(87)90107-4","article-title":"The maximum k-colorable subgraph problem for chordal graphs","volume":"24","author":"Yannakakis","year":"1987","journal-title":"Information Processing Letters"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X13002448?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X13002448?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,15]],"date-time":"2018-10-15T06:56:29Z","timestamp":1539586589000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X13002448"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":43,"alternative-id":["S0166218X13002448"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2013.05.015","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2014,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The maximum vertex coverage problem on bipartite graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2013.05.015","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}