{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:47:16Z","timestamp":1725558436495},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_19","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T11:00:50Z","timestamp":1276167650000},"page":"188-199","source":"Crossref","is-referenced-by-count":7,"title":["A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs"],"prefix":"10.1007","author":[{"given":"Imran A.","family":"Pirwani","sequence":"first","affiliation":[]},{"given":"Mohammad R.","family":"Salavatipour","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/978-3-540-27820-7_5","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"J. Aspnes","year":"2004","unstructured":"Aspnes, J., Goldenberg, D.K., Yang, Y.R.: On the computational complexity of sensor network localization. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2004. LNCS, vol.\u00a03121, pp. 32\u201344. Springer, Heidelberg (2004)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"2832","DOI":"10.1007\/978-0-387-74759-0_486","volume-title":"Encyclopedia of Optimization","author":"B. Balasundaram","year":"2009","unstructured":"Balasundaram, B., Butenko, S.: Optimization problems in unit-disk graphs. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 2832\u20132844. Springer, Heidelberg (2009)"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/0196-6774(91)90007-L","volume":"12","author":"V. Capoyleas","year":"1991","unstructured":"Capoyleas, V., Rote, G., Woeginger, G.J.: Geometric clusterings. J. Algorithms\u00a012(2), 341\u2013356 (1991)","journal-title":"J. Algorithms"},{"issue":"12","key":"19_CR4","doi-asserted-by":"publisher","first-page":"2270","DOI":"10.1016\/j.dam.2007.10.015","volume":"156","author":"M.R. Cerioli","year":"2008","unstructured":"Cerioli, M.R., Faria, L., Ferreira, T.O., Martinhon, C.A.J., Protti, F., Reed, B.: Partition into cliques for cubic graphs: Planar case, complexity and approximation. Discrete Applied Mathematics\u00a0156(12), 2270\u20132278 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"19_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":"19_CR6","unstructured":"Dumitrescu, A., Pach, J.: Minimum clique partition in unit disk graphs. CoRR, abs\/0909.1552 (2009)"},{"issue":"5","key":"19_CR7","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/j.dam.2006.03.039","volume":"156","author":"G. Finke","year":"2008","unstructured":"Finke, G., Jost, V., Queyranne, M., Seb\u00f6, A.: Batch processing with interval graph compatibilities between tasks. Discrete Applied Mathematics\u00a0156(5), 556\u2013568 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1383369.1383380","volume":"4","author":"T. Nieberg","year":"2008","unstructured":"Nieberg, T., Hurink, J., Kern, W.: Approximation schemes for wireless networks. ACM Transactions on Algorithms\u00a04(4), 1\u201317 (2008)","journal-title":"ACM Transactions on Algorithms"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Pandit, S., Pemmaraju, S., Varadarajan, K.: Approximation algorithms for domatic partitions of unit disk graphs. In: APPROX-RANDOM, pp. 312\u2013325 (2009)","DOI":"10.1007\/978-3-642-03685-9_24"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-75520-3_29","volume-title":"Algorithms \u2013 ESA 2007","author":"S.V. Pemmaraju","year":"2007","unstructured":"Pemmaraju, S.V., Pirwani, I.A.: Good quality virtual realization of unit ball graphs. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 311\u2013322. Springer, Heidelberg (2007)"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Pirwani, I.A., Salavatipour, M.R.: A weakly robust PTAS for minimum clique partition in unit disk graphs. CoRR, abs\/0904.2203 (2009)","DOI":"10.1007\/978-3-642-13731-0_19"},{"issue":"1","key":"19_CR12","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"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T02:45:16Z","timestamp":1578537916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_19"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}