{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:20:58Z","timestamp":1648981258251},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,11,14]],"date-time":"2009-11-14T00:00:00Z","timestamp":1258156800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s11786-009-0001-1","type":"journal-article","created":{"date-parts":[[2009,11,13]],"date-time":"2009-11-13T09:10:24Z","timestamp":1258103424000},"page":"97-107","source":"Crossref","is-referenced-by-count":4,"title":["On Conditional Covering Problem"],"prefix":"10.1007","volume":"3","author":[{"given":"Balasubramanian","family":"Sivan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Harini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,11,14]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0305-0548(87)90053-0","volume":"14","author":"S.S. Chaudhry","year":"1987","unstructured":"Chaudhry S.S., Moon I.D., McCormick S.T.: Conditional covering: greedy heuristics and computational results. Comput. OR 14(1), 11\u201318 (1987)","journal-title":"Comput. OR"},{"issue":"4","key":"1_CR2","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/nav.20074","volume":"52","author":"J.B. Goldberg","year":"2005","unstructured":"Goldberg J.B., Lunday B.J., Smith J.C.: Algorithms for solving the conditional covering problem on paths. Naval Res. Logist. 52(4), 293\u2013301 (2005)","journal-title":"Naval Res. Logist."},{"key":"1_CR3","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)"},{"issue":"4","key":"1_CR4","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1002\/net.20087","volume":"46","author":"J.A. Horne","year":"2005","unstructured":"Horne J.A., Smith J.C.: A dynamic programming algorithm for the conditional covering problem on tree graphs. Networks 46(4), 186\u2013197 (2005)","journal-title":"Networks"},{"issue":"4","key":"1_CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/net.20086","volume":"46","author":"J.A. Horne","year":"2005","unstructured":"Horne J.A., Smith J.C.: Dynamic programming algorithms for the conditional covering problem on path and extended star graphs. Networks 46(4), 177\u2013185 (2005)","journal-title":"Networks"},{"issue":"1\u20133","key":"1_CR6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0166-218X(99)00128-6","volume":"99","author":"D. Kratsch","year":"2000","unstructured":"Kratsch D.: Domination and total domination on asteroidal triple-free graphs. Discrete Appl. Math. 99(1\u20133), 111\u2013123 (2000)","journal-title":"Discrete Appl. Math."},{"key":"1_CR7","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1287\/mnsc.30.3.290","volume":"30","author":"I.D. Moon","year":"1984","unstructured":"Moon I.D., Chaudhry S.S.: An analysis of network location problems with distance constraints. Manage. Sci. 30, 290\u2013307 (1984)","journal-title":"Manage. Sci."},{"issue":"9","key":"1_CR8","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1016\/0305-0548(94)00079-N","volume":"22","author":"I.D. Moon","year":"1995","unstructured":"Moon I.D., Papayanopoulos L.: Facility location on a tree with maximum distance constraints. Comput. OR 22(9), 905\u2013914 (1995)","journal-title":"Comput. OR"},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1287\/mnsc.30.3.290","volume":"30","author":"J. Pfaff","year":"1984","unstructured":"Pfaff J., Laskar R., Hedetniemi S.T.: Linear algorithms for independent domination and total domination in series-parallel graphs. Manage. Sci. 30, 290\u2013307 (1984)","journal-title":"Manage. Sci."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-009-0001-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-009-0001-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-009-0001-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T22:32:27Z","timestamp":1559428347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-009-0001-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,14]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["1"],"URL":"https:\/\/doi.org\/10.1007\/s11786-009-0001-1","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,14]]}}}