{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:47Z","timestamp":1759638347346},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_84","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"829-838","source":"Crossref","is-referenced-by-count":6,"title":["Complexity and Approximation of Satisfactory Partition Problems"],"prefix":"10.1007","author":[{"given":"Cristina","family":"Bazgan","sequence":"first","affiliation":[]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Vanderpooten","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"84_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-540-24587-2_46","volume-title":"Algorithms and Computation","author":"C. Bazgan","year":"2003","unstructured":"Bazgan, C., Tuza, Z., Vanderpooten, D.: On the existence and determination of satisfactory partitions in a graph. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 444\u2013453. Springer, Heidelberg (2003)"},{"key":"84_CR2","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canadian J. of Math\u00a017, 449\u2013467 (1965)","journal-title":"Canadian J. of Math"},{"key":"84_CR3","first-page":"401","volume":"9","author":"T. Gallai","year":"1964","unstructured":"Gallai, T.: Maximale Systeme unabh\u00e4ngiger Kanten. Magyar Tud. Akad. Mat. Kutat \u00f3 Int. K\u00f6zl.\u00a09, 401\u2013413 (1964)","journal-title":"Magyar Tud. Akad. Mat. Kutat \u00f3 Int. K\u00f6zl."},{"key":"84_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco (1979)"},{"unstructured":"Gerber, M., Kobler, D.: Partitioning a graph to satisfy all vertices, Technical report, Swiss Federal Institute of Technology, Lausanne (1998)","key":"84_CR5"},{"key":"84_CR6","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0377-2217(99)00459-2","volume":"125","author":"M. Gerber","year":"2000","unstructured":"Gerber, M., Kobler, D.: Algorithmic approach to the satisfactory graph partitioning problem. European Journal of Operation Research\u00a0125, 283\u2013291 (2000)","journal-title":"European Journal of Operation Research"},{"key":"84_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01202286","volume":"4","author":"E. Petrank","year":"1994","unstructured":"Petrank, E.: The hardness of approximation: gap location. Computational Complexity\u00a04, 133\u2013157 (1994)","journal-title":"Computational Complexity"},{"key":"84_CR8","first-page":"183","volume":"154","author":"K.H. Shafique","year":"2002","unstructured":"Shafique, K.H., Dutton, R.D.: On satisfactory partitioning of graphs. Congressus Numerantium\u00a0154, 183\u2013194 (2002)","journal-title":"Congressus Numerantium"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_84","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:03:32Z","timestamp":1553155412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11533719_84","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}