{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:52:54Z","timestamp":1725583974599},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_6","type":"book-chapter","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T00:43:48Z","timestamp":1369097028000},"page":"24-35","source":"Crossref","is-referenced-by-count":2,"title":["Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds"],"prefix":"10.1007","author":[{"given":"Pawan","family":"Aurora","sequence":"first","affiliation":[]},{"given":"Sumit","family":"Singh","sequence":"additional","affiliation":[]},{"given":"Shashank K.","family":"Mehta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/11611257_21","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"F. Dehne","year":"2006","unstructured":"Dehne, F., Fellows, M., Fernau, H., Prieto, E., Rosamond, F.: nonblocker: Parameterized algorithmics for minimum dominating set. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol.\u00a03831, pp. 237\u2013245. Springer, Heidelberg (2006)"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K. Jain","year":"2001","unstructured":"Jain, K.: A factor 2 approximation algorithm for the generalized steiner network problem. Combinatorica\u00a021(1), 39\u201360 (2001)","journal-title":"Combinatorica"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1093\/imamat\/14.2.183","volume":"14","author":"J. Nieminen","year":"1974","unstructured":"Nieminen, J.: Two bounds for the domination number of a graph. Journal of the Institute of Mathematics and its Applications\u00a014, 183\u2013187 (1974)","journal-title":"Journal of the Institute of Mathematics and its Applications"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-642-29700-7_33","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"P. Zhang","year":"2012","unstructured":"Zhang, P.: Partial degree bounded edge packing problem. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) FAW-AAIM 2012. LNCS, vol.\u00a07285, pp. 359\u2013367. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T07:01:52Z","timestamp":1557730912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}