{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T15:40:01Z","timestamp":1738251601568,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_69","type":"book-chapter","created":{"date-parts":[[2008,6,4]],"date-time":"2008-06-04T15:26:57Z","timestamp":1212593217000},"page":"760-769","source":"Crossref","is-referenced-by-count":0,"title":["An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Jianxin","family":"Wang","sequence":"first","affiliation":[]},{"given":"Xiaoshuang","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"69_CR1","doi-asserted-by":"crossref","unstructured":"Blough, D.M.: On the reconfigurable of memory arrays containing clustered faults. In: Proc. 21th Int. Symp. on Fault-Tolerant Computing (FTCS\u201991), pp. 444\u2013451 (1991)","DOI":"10.1109\/FTCS.1991.146699"},{"issue":"3","key":"69_CR2","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1109\/12.127443","volume":"41","author":"D.M. Blough","year":"1992","unstructured":"Blough, D.M., Pelc, A.: Complexity of fault diagnosis in comparison models. IEEE Trans. Comput.\u00a041(3), 318\u2013323 (1992)","journal-title":"IEEE Trans. Comput."},{"key":"69_CR3","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.jcss.2003.09.003","volume":"67","author":"J. Chen","year":"2003","unstructured":"Chen, J., Kanj, I.A.: Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. Journal of Computer and System Science\u00a067, 833\u2013847 (2003)","journal-title":"Journal of Computer and System Science"},{"key":"69_CR4","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1992","unstructured":"Cormen, T.H., Leiserson, C.E., Rovest, R.L.: Introduction to Algorithms. McGraw-Hill, New York (1992)"},{"key":"69_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)"},{"key":"69_CR6","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1006\/jagm.2000.1141","volume":"38","author":"H. Fernau","year":"2001","unstructured":"Fernau, H., Niedermeier, R.: An efficient exact algorithm for constraint bipartite vertex cover. J. Algorithms\u00a038, 374\u2013410 (2001)","journal-title":"J. Algorithms"},{"key":"69_CR7","doi-asserted-by":"crossref","unstructured":"Hasan, N., Liu, C.L.: Minimum Fault Coverage in Reconfigurable Arrays. In: Proc. 18th Int. Symp. on Fault-Tolerant Computing (FTCS\u201988), pp. 348\u2013353 (1988)","DOI":"10.1109\/FTCS.1988.5342"},{"key":"69_CR8","doi-asserted-by":"crossref","unstructured":"Hasan, N., Liu, C.L.: Fault covers in reconfigurable PLAs. In: Proc. 20th Int. Symp. on Fault-Tloerant Computing (FTCS\u201990), pp. 166\u2013173 (1990)","DOI":"10.1109\/FTCS.1990.89352"},{"key":"69_CR9","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MDT.1987.295111","volume":"4","author":"S.-Y. Kuo","year":"1987","unstructured":"Kuo, S.-Y., Fuchs, W.: Efficient spare allocation for reconfigurable arrays. IEEE Des. Test\u00a04, 24\u201331 (1987)","journal-title":"IEEE Des. Test"},{"key":"69_CR10","series-title":"Annals of Discrete Mathematics","volume-title":"Matching Theory","author":"L. Lovasz","year":"1986","unstructured":"Lovasz, L., Plummer, M.D.: Matching Theory. Annals of Discrete Mathematics, vol.\u00a029. North-Holland, Amsterdam (1986)"},{"issue":"1","key":"69_CR11","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1109\/12.509914","volume":"45","author":"C.P. Low","year":"1996","unstructured":"Low, C.P., Leong, H.W.: A new class of efficient algorithms for reconfiguration of memery arrays. IEEE Trans. Comput.\u00a045(1), 614\u2013618 (1996)","journal-title":"IEEE Trans. Comput."},{"key":"69_CR12","volume-title":"Principles of Artificial Intelligence","author":"N.J. Nilsson","year":"1980","unstructured":"Nilsson, N.J.: Principles of Artificial Intelligence. Tioga Publishing Co., Palo Alto (1980)"},{"key":"69_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/12.481492","volume":"45","author":"M.D. Smith","year":"1996","unstructured":"Smith, M.D., Mazumder, P.: Generation of minimal vertex cover for row\/column allocation in self-repairable arrays. IEEE Trans. Comput.\u00a045, 109\u2013115 (1996)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T15:26:26Z","timestamp":1738250786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_69","relation":{},"subject":[]}}