{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T20:35:55Z","timestamp":1770323755882,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642208065","type":"print"},{"value":"9783642208072","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20807-2_21","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T09:58:49Z","timestamp":1308391129000},"page":"261-273","source":"Crossref","is-referenced-by-count":9,"title":["Safe Lower Bounds for Graph Coloring"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Held","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Cook","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edward C.","family":"Sewell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Andrade, D.V., Resende, M.G.C., Werneck, R.F.: Fast local search for the maximum independent set problem. In: Proceedings of Workshop on Experimental Algorithms, pp. 220\u2013234 (2008)","DOI":"10.1007\/978-3-540-68552-4_17"},{"issue":"6","key":"21_CR2","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.orl.2006.12.010","volume":"35","author":"D.L. Applegate","year":"2007","unstructured":"Applegate, D.L., Cook, W., Dash, S., Espinoza, D.G.: Exact solutions to linear programming problems. Operations Research Letters\u00a035(6), 693\u2013699 (2007)","journal-title":"Operations Research Letters"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF02243394","volume":"52","author":"L. Babel","year":"1994","unstructured":"Babel, L.: A fast algorithm for the maximum weight clique problem. Computing\u00a052, 31\u201338 (1994)","journal-title":"Computing"},{"issue":"2","key":"21_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1137\/0220012","volume":"20","author":"E. Balas","year":"1991","unstructured":"Balas, E., Xue, J.: Minimum weighted coloring of triangulated graphs with application to maximum weight vertex packing and clique finding in arbitrary graphs. SIAM Journal of Computing\u00a020(2), 209\u2013221 (1991)","journal-title":"SIAM Journal of Computing"},{"issue":"4","key":"21_CR5","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E. Balas","year":"1986","unstructured":"Balas, E., Yu, C.S.: Finding a maximum clique in an arbitrary graph. SIAM Journal of Computing\u00a015(4), 1054\u20131068 (1986)","journal-title":"SIAM Journal of Computing"},{"issue":"4","key":"21_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D.: New methods to color the vertices of a graph. Communications of the ACM\u00a022(4), 251\u2013256 (1979)","journal-title":"Communications of the ACM"},{"issue":"4","key":"21_CR7","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/net.20035","volume":"44","author":"M. Caramia","year":"2004","unstructured":"Caramia, M., Dell\u2019Olmo, P.: Bounding vertex coloring by truncated multistage branch and bound. Networks\u00a044(4), 231\u2013242 (2004)","journal-title":"Networks"},{"key":"21_CR8","unstructured":"Gualandi, S., Malucelli, F.: Exact solution of graph coloring problems via constraint programming and column generation. Optimization Online in press for INFORMS Journal on Computing (2010)"},{"key":"21_CR9","unstructured":"Held, S., Sewell, E.C., Cook, W.: Exact colors project webpage (2010), http:\/\/code.google.com\/p\/exactcolors\/"},{"issue":"5","key":"21_CR10","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. Journal of the ACM\u00a041(5), 960\u2013981 (1994)","journal-title":"Journal of the ACM"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Malaguti, E., Monaci, M., Toth, P.: An exact approach for the vertex coloring problem. Discrete Optimization (2010) (in press)","DOI":"10.1016\/j.disopt.2010.07.005"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00696.x","volume":"17","author":"E. Malaguti","year":"2010","unstructured":"Malaguti, E., Toth, P.: A survey on vertex coloring problems. International Transactions in Operational Research\u00a017, 1\u201334 (2010)","journal-title":"International Transactions in Operational Research"},{"issue":"4","key":"21_CR13","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","volume":"8","author":"A. Mehrotra","year":"1996","unstructured":"Mehrotra, A., Trick, M.A.: A Column Generation Approach for Graph Coloring. INFORMS Journal on Computing\u00a08(4), 344\u2013354 (1996)","journal-title":"INFORMS Journal on Computing"},{"key":"21_CR14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","volume":"3","author":"J. Mycielski","year":"1955","unstructured":"Mycielski, J.: Sur le coloriage des graphes. Colloq. Math.\u00a03, 161\u2013162 (1955)","journal-title":"Colloq. Math."},{"issue":"5","key":"21_CR15","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1016\/j.dam.2005.05.022","volume":"154","author":"I. M\u00e9ndez-D\u00edaz","year":"2006","unstructured":"M\u00e9ndez-D\u00edaz, I., Zabala, P.: A branch-and-cut algorithm for graph coloring. Discrete Applied Mathematics\u00a0154(5), 826\u2013847 (2006)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"21_CR16","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.dam.2006.07.010","volume":"156","author":"I. M\u00e9ndez D\u00edaz","year":"2008","unstructured":"M\u00e9ndez D\u00edaz, I., Zabala, P.: A cutting plane algorithm for graph coloring. Discrete Applied Mathematics\u00a0156(2), 159\u2013179 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"10","key":"21_CR17","doi-asserted-by":"publisher","first-page":"1822","DOI":"10.1016\/j.cor.2010.01.015","volume":"37","author":"D.C. Porumbel","year":"2010","unstructured":"Porumbel, D.C., Hao, J.-K., Kuntz, P.: An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring. Computers and Operations Research\u00a037(10), 1822\u20131832 (2010)","journal-title":"Computers and Operations Research"},{"issue":"4","key":"21_CR18","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/ijoc.10.4.438","volume":"10","author":"E.C. Sewell","year":"1998","unstructured":"Sewell, E.C.: A branch and bound algorithm for the stability number of a sparse graph. INFORMS Journal on Computing\u00a010(4), 438\u2013447 (1998)","journal-title":"INFORMS Journal on Computing"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Titiloye, O., Crispin, A.: Quantum annealing of the graph coloring problem. Discrete Optimization (2011) (in Press)","DOI":"10.1016\/j.disopt.2010.12.001"},{"key":"21_CR20","unstructured":"Trick, M.A.: DIMACS Graph Coloring Instances (2002), http:\/\/mat.gsia.cmu.edu\/COLOR02\/"},{"key":"21_CR21","unstructured":"Warren, J.S., Hicks, I.V.: Combinatorial branch-and-bound for the maximum weight independent set problem. Technical report, Texas A&M University (2006)"},{"issue":"1","key":"21_CR22","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D. Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing\u00a03(1), 103\u2013128 (2007)","journal-title":"Theory of Computing"},{"key":"21_CR23","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S1571-0653(05)80045-9","volume":"3","author":"P.R.J. \u00d6sterg\u00e5rd","year":"1999","unstructured":"\u00d6sterg\u00e5rd, P.R.J.: A new algorithm for the maximum-weight clique problem. Electronic Notes in Discrete Mathematics\u00a03, 153\u2013156 (1999)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"21_CR24","unstructured":"\u00d6sterg\u00e5rd, P.R.J., Niskanen, S.: Cliquer home page (2010), http:\/\/users.tkk.fi\/pat\/cliquer.html"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatoral Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20807-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T20:16:07Z","timestamp":1560284167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20807-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208065","9783642208072"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20807-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}