{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:22Z","timestamp":1725574102899},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183805"},{"type":"electronic","value":"9783642183812"}],"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-18381-2_12","type":"book-chapter","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T11:01:51Z","timestamp":1294138911000},"page":"146-156","source":"Crossref","is-referenced-by-count":2,"title":["GreedyMAX-type Algorithms for the Maximum Independent Set Problem"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Borowiecki","sequence":"first","affiliation":[]},{"given":"Frank","family":"G\u00f6ring","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","first-page":"426","volume-title":"Algorithms - ESA99","author":"K. Aardal","year":"1999","unstructured":"Aardal, K., Verweij, B.: An optimization algorithm for maximum independent set with applications in map labeling. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, pp. 426\u2013437. Springer, Heidelberg (1999)"},{"issue":"6","key":"12_CR2","first-page":"33","volume":"23","author":"B.D. Acharya","year":"1977","unstructured":"Acharya, B.D., Vartak, M.N.: On the construction of graphs with given constant valence-difference(s) on each of their lines. Wissenschaftliche Zeitschrifte TH Ilmenau\u00a023(6), 33\u201360 (1977)","journal-title":"Wissenschaftliche Zeitschrifte TH Ilmenau"},{"key":"12_CR3","volume-title":"The probabilistic method","author":"N. Alon","year":"1992","unstructured":"Alon, N., Spencer, J.H.: The probabilistic method. Wiley, New York (1992)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01994876","volume":"32","author":"R. Boppana","year":"1992","unstructured":"Boppana, R., Halld\u00f3rsson, M.M.: Approximating maximum independent sets by excluding subgraphs. BIT\u00a032, 180\u2013196 (1992)","journal-title":"BIT"},{"key":"12_CR5","volume-title":"New results on the independence number","author":"Y. Caro","year":"1979","unstructured":"Caro, Y.: New results on the independence number. Technical Report, Tel-Aviv University (1979)"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01191201","volume":"12","author":"V. Chv\u00e1tal","year":"1992","unstructured":"Chv\u00e1tal, V., McDiarmid, C.: Small transversals in hypergraphs. Combinatorica\u00a012, 19\u201326 (1992)","journal-title":"Combinatorica"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1137\/S0895480199361259","volume":"14","author":"T. Erlebach","year":"2001","unstructured":"Erlebach, T., Jansen, K.: The maximum edge-disjoint paths problem in bidirected trees. SIAM J. Discrete Math.\u00a014, 326\u2013355 (2001)","journal-title":"SIAM J. Discrete Math."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and Conquer: A simple O(20.288n) independent set algorithm. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, pp. 18\u201325 (2006)","DOI":"10.1145\/1109557.1109560"},{"key":"12_CR9","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. H. Freeman and Company, New York (1979)"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/0095-8956(83)90003-5","volume":"34","author":"J.R. Griggs","year":"1983","unstructured":"Griggs, J.R.: Lower bounds on the independence number in terms of the degrees. J. Combin. Theory Ser. B\u00a034, 22\u201339 (1983)","journal-title":"J. Combin. Theory Ser. B"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02523693","volume":"18","author":"M.M. Halld\u00f3rsson","year":"1997","unstructured":"Halld\u00f3rsson, M.M., Radhakrishnan, J.: Greed is good: Approximating independent sets in sparse and bounded-degree graphs. Algorithmica\u00a018, 145\u2013163 (1997)","journal-title":"Algorithmica"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0053959","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M.M. Halld\u00f3rsson","year":"1998","unstructured":"Halld\u00f3rsson, M.M.: Approximations of independent sets in graphs. In: Jansen, K., Rolim, J.D.P. (eds.) APPROX 1998. LNCS, vol.\u00a01444, pp. 1\u201313. Springer, Heidelberg (1998)"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0012-365X(98)00048-X","volume":"188","author":"J. Harant","year":"1998","unstructured":"Harant, J.: A lower bound on the independence number of a graph. Discrete Math.\u00a0188, 239\u2013243 (1998)","journal-title":"Discrete Math."},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0012-365X(02)00571-X","volume":"256","author":"J. Harant","year":"2002","unstructured":"Harant, J., Ryja\u010dek, Z., Schiermeyer, I.: Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set. Discrete Math.\u00a0256, 193\u2013201 (2002)","journal-title":"Discrete Math."},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0012-365X(00)00298-3","volume":"232","author":"J. Harant","year":"2001","unstructured":"Harant, J., Schiermeyer, I.: On the independence number of a graph in terms of order and size. Discrete Math.\u00a0232, 131\u2013138 (2001)","journal-title":"Discrete Math."},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"431","DOI":"10.7151\/dmgt.1335","volume":"26","author":"J. Harant","year":"2006","unstructured":"Harant, J., Schiermeyer, I.: A lower bound on the independence number of a graph in terms of degrees. Discuss. Math. Graph Theory\u00a026, 431\u2013437 (2006)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n 1\u2009\u2212\u2009\u03b5 . Acta Math.\u00a0182(1), 105\u2013142 (1999)","journal-title":"Acta Math."},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0166-218X(94)00051-E","volume":"60","author":"A. Hertz","year":"1995","unstructured":"Hertz, A.: Polynomially solvable cases for the maximum stable set problem. Discrete Appl. Math.\u00a060, 195\u2013210 (1995)","journal-title":"Discrete Appl. Math."},{"key":"12_CR19","volume-title":"Approximation Algorithms for NP-hard problems","author":"D.S. Hochbaum","year":"1995","unstructured":"Hochbaum, D.S.: Approximating covering and packing problems: set cover, vertex cover, independent set and related problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-hard problems. PWS Publishing Company, Boston (1995)"},{"issue":"4","key":"12_CR20","first-page":"843","volume":"22","author":"S. Jendrol\u2019","year":"1981","unstructured":"Jendrol\u2019, S., Ryja\u010dek, Z.: 3-polytopes of constant tolerance of edges. Commentationes Mathematicae Universitatis Carolinae\u00a022(4), 843\u2013850 (1981)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"12_CR21","unstructured":"Malesi\u0144ska, E.: Graph-theoretical models for frequency assignment problems. Ph.D. Thesis, Technische Universitat Berlin (1997)"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(91)90357-8","volume":"90","author":"O. Murphy","year":"1991","unstructured":"Murphy, O.: Lower bounds on the stability number of a graphs computed in terms of degrees. Discrete Math.\u00a090, 207\u2013211 (1991)","journal-title":"Discrete Math."},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/S0012-365X(00)00335-6","volume":"231","author":"D. Rautenbach","year":"2001","unstructured":"Rautenbach, D.: On vertex orderings and the stability number in triangle-free graphs. Discrete Math.\u00a0231, 411\u2013420 (2001)","journal-title":"Discrete Math."},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0166-218X(02)00205-6","volume":"126","author":"S. Sakai","year":"2003","unstructured":"Sakai, S., Togasaki, M., Yamazaki, K.: A note on greedy algorithms for the maximum weighted independent set problem. Discrete Applied Math.\u00a0126, 313\u2013322 (2003)","journal-title":"Discrete Applied Math."},{"key":"12_CR25","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0012-365X(93)00102-B","volume":"132","author":"S.M. Selkow","year":"1994","unstructured":"Selkow, S.M.: A probabilistic lower bound on the independence number of graphs. Discrete Math.\u00a0132, 363\u2013365 (1994)","journal-title":"Discrete Math."},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BFb0053973","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"F. Spieksma","year":"1998","unstructured":"Spieksma, F.: Approximating an interval scheduling problem. In: Jansen, K., Rolim, J.D.P. (eds.) APPROX 1998. LNCS, vol.\u00a01444, pp. 169\u2013180. Springer, Heidelberg (1998)"},{"key":"12_CR27","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: On an extremal problem in graph theory. Mat. Fiz. Lapok\u00a048, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"},{"key":"12_CR28","unstructured":"Wei, V.K.: A lower bound on the stability number of a simple graph. Technical Memorandum No. 81-11217-9, Bell Laboratories (1981)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2011: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18381-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T11:02:42Z","timestamp":1559905362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18381-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183805","9783642183812"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18381-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}