{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:04:16Z","timestamp":1725563056408},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153686"},{"type":"electronic","value":"9783642153693"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15369-3_20","type":"book-chapter","created":{"date-parts":[[2010,8,27]],"date-time":"2010-08-27T04:01:36Z","timestamp":1282881696000},"page":"260-273","source":"Crossref","is-referenced-by-count":5,"title":["Approximation Algorithms for Intersection Graphs"],"prefix":"10.1007","author":[{"given":"Frank","family":"Kammer","sequence":"first","affiliation":[]},{"given":"Torsten","family":"Tholey","sequence":"additional","affiliation":[]},{"given":"Heiko","family":"Voepel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Akcoglu, K., Aspnes, J., DasGupta, B., Kao, M.-Y.: Opportunity cost algorithms for combinatorial auctions. In: Kontoghiorghes, E.J., Rustem, B., Siokos, S. (eds.) Applied Optimization: Computational Methods in Decision Making, Economics and Finance, vol.\u00a074, pp. 455\u2013479 (2002)","DOI":"10.1007\/978-1-4757-3613-7_23"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703437843","volume":"36","author":"R. Bar-Yehuda","year":"2006","unstructured":"Bar-Yehuda, R., Halld\u00f3rsson, M.M., Naor, J., Shachnai, H., Shapira, I.: Scheduling split intervals. SIAM J. Comput.\u00a036, 1\u201315 (2006)","journal-title":"SIAM J. Comput."},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput.\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"20_CR4","unstructured":"Butman, A., Hermelin, D., Lewenstein, M., Rawitz, D.: Optimization problems in multiple-interval graphs. In: Proc.18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 268\u2013277 (2007)"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.endm.2004.06.012","volume":"18","author":"M.R. Cerioli","year":"2004","unstructured":"Cerioli, M.R., Faria, L., Ferreira, T.O., Protti, F.: On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation. Electronic Notes in Discrete Mathematics\u00a018, 73\u201379 (2004)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/S0196-6774(02)00294-8","volume":"46","author":"T.M. Chan","year":"2003","unstructured":"Chan, T.M.: Polynomial-time approximation schemes for packing and piercing fat objects. J. Algorithms\u00a046, 178\u2013189 (2003)","journal-title":"J. Algorithms"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B.N. Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math.\u00a086, 165\u2013177 (1990)","journal-title":"Discrete Math."},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inform. and Comput.\u00a085, 12\u201375 (1990)","journal-title":"Inform. and Comput."},{"key":"20_CR9","unstructured":"Dumitrescu, A., Pach, J.: Minimum clique partition in unit disk graphs, arXiv:0909.1552v1"},{"key":"20_CR10","unstructured":"Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric intersection graphs. In: Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 671\u2013679 (2001)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/978-3-540-78773-0_64","volume-title":"LATIN 2008: Theoretical Informatics","author":"T. Erlebach","year":"2008","unstructured":"Erlebach, T., van Leeuwen, E.J.: Domination in geometric intersection graphs. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 747\u2013758. Springer, Heidelberg (2008)"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"R.J. Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inform. Process. Lett.\u00a012, 133\u2013137 (1981)","journal-title":"Inform. Process. Lett."},{"key":"20_CR13","unstructured":"Frank, A.: Some polynomial algorithms for certain graphs and hypergraphs. In: Proc. 5th British Combinatorial Conference (Aberdeen 1975), Congr. Numer. XV., pp. 211\u2013226 (1976)"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoret. Comput. Sci.\u00a01, 237\u2013267 (1976)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F. Gavril","year":"1972","unstructured":"Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Comput.\u00a01, 180\u2013187 (1972)","journal-title":"SIAM J. Comput."},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. 18th Annual European Symposium on Algorithms (ESA 2010)","author":"T. Gibson","year":"2010","unstructured":"Gibson, T., Pirwani, I.A.: Approximation algorithms for dominating set in disk graphs. In: Proc. 18th Annual European Symposium on Algorithms (ESA 2010). LNCS. Springer, Heidelberg (2010) (to appear)"},{"key":"20_CR17","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF01864170","volume":"4","author":"M.C. Golumbic","year":"1988","unstructured":"Golumbic, M.C.: Algorithmic aspects of intersection graphs and representation hypergraphs. Graphs and Combinatorics\u00a04, 307\u2013321 (1988)","journal-title":"Graphs and Combinatorics"},{"key":"20_CR19","unstructured":"Gr\u00e4f, A.: Coloring and recognizing special graph classes, Technical Report Musikinformatik und Medientechnik Bericht 20\/95, Johannes Gutenberg-Universit\u00e4t Mainz (1995)"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Data reduction and exact algorithms for clique cover. Journal of Experimental Algorithmics\u00a013, Article No. 2 (2009)","DOI":"10.1145\/1412228.1412236"},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0601001","volume":"1","author":"J.R. Griggs","year":"1980","unstructured":"Griggs, J.R., West, D.B.: Extremal values of the interval number of a graph. SIAM Journal on algebraic and discrete methods\u00a01, 1\u20137 (1980)","journal-title":"SIAM Journal on algebraic and discrete methods"},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1997.0903","volume":"26","author":"H.B. Hunt III","year":"1998","unstructured":"Hunt III, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC-pproximation schemes for NP- and PSPACE-hard problems for geometric graphs. J. Algorithms\u00a026, 238\u2013274 (1998)","journal-title":"J. Algorithms"},{"key":"20_CR23","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.ipl.2008.09.021","volume":"109","author":"J.L. Hurink","year":"2008","unstructured":"Hurink, J.L., Nieberg, T.: Approximating minimum independent dominating sets in wireless networks. Inform. Process. Lett.\u00a0109, 155\u2013160 (2008)","journal-title":"Inform. Process. Lett."},{"key":"20_CR24","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/0196-6774(83)90012-3","volume":"4","author":"H. Imai","year":"1983","unstructured":"Imai, H., Asano, T.: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. J. Algorithms\u00a04, 310\u2013323 (1983)","journal-title":"J. Algorithms"},{"key":"20_CR25","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0012-365X(99)00231-9","volume":"215","author":"R.E. Jamison","year":"2000","unstructured":"Jamison, R.E., Mulder, H.M.: Tolerance intersection graphs on binary trees trees with constant tolerance 3. Discrete Math.\u00a0215, 115\u2013131 (2000)","journal-title":"Discrete Math."},{"key":"20_CR26","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. System Sci.\u00a09, 256\u2013278 (1974)","journal-title":"J. Comput. System Sci."},{"key":"20_CR27","unstructured":"Kammer, F., Tholey, T., Voepel, H.: Approximation algorithms for intersection graphs, Report 2009\u20136, Institut f\u00fcr Informatik, Universit\u00e4t Augsburg (2009)"},{"key":"20_CR28","unstructured":"Malesi\u0144ska, E.: Graph-theoretical models for frequency assignment problems, PhD thesis, University of Berlin (1997)"},{"key":"20_CR29","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"M.V. Marathe","year":"1995","unstructured":"Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks\u00a025, 59\u201368 (1995)","journal-title":"Networks"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"Nieberg, T., Hurink, J., Kern, W.: Approximation Schemes for Wireless Networks. ACM Transactions on Algorithms\u00a04, Article No. 49 (2008)","DOI":"10.1145\/1383369.1383380"},{"key":"20_CR31","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. System Sci.\u00a043, 425\u2013440 (1991)","journal-title":"J. Comput. System Sci."},{"key":"20_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-13731-0_19","volume-title":"SWAT 2010","author":"I.A. Pirwani","year":"2010","unstructured":"Pirwani, I.A., Salavatipour, M.R.: A weakly-robust PTAS for minimum clique partition on unit disk graphs. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol.\u00a06139, pp. 188\u2013199. Springer, Heidelberg (2010)"},{"key":"20_CR33","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"\u00c9. Tardos","year":"1986","unstructured":"Tardos, \u00c9.: A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research\u00a034, 250\u2013256 (1986)","journal-title":"Operations Research"},{"key":"20_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1007\/978-3-642-02927-1_64","volume-title":"Automata, Languages and Programming","author":"Y. Ye","year":"2009","unstructured":"Ye, Y., Borodin, A.: Elimination graphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 774\u2013785. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15369-3_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:05:22Z","timestamp":1606187122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15369-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153686","9783642153693"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15369-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}