{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:41Z","timestamp":1725559001500},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262244"},{"type":"electronic","value":"9783540324409"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496199_46","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T06:29:15Z","timestamp":1279088955000},"page":"427-439","source":"Crossref","is-referenced-by-count":5,"title":["Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs"],"prefix":"10.1007","author":[{"given":"Gregory","family":"Gutin","sequence":"first","affiliation":[]},{"given":"Arash","family":"Rafiey","sequence":"additional","affiliation":[]},{"given":"Anders","family":"Yeo","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Tso","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1137\/S0895480191217569","volume":"7","author":"A.A. Ageev","year":"1994","unstructured":"Ageev, A.A.: On finding critical independent and vertex sets. SIAM J. Discrete Math.\u00a07, 293\u2013295 (1994)","journal-title":"SIAM J. Discrete Math."},{"key":"46_CR2","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1137\/S0097539791199334","volume":"23","author":"R.K. Ahuja","year":"1994","unstructured":"Ahuja, R.K., Orlin, J.B., Stein, C., Tarjan, R.E.: Improved algorithms for bipartite network flows. SIAM J. Comput.\u00a023, 906\u2013933 (1994)","journal-title":"SIAM J. Comput."},{"key":"46_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511984068","volume-title":"Bipartite Graphs and Their Applications","author":"A.S. Asratian","year":"1998","unstructured":"Asratian, A.S., Denley, T.M.J., Haggkvist, R.: Bipartite Graphs and Their Applications. Cambridge University Press, Cambridge (1998)"},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1093\/imaman\/9.4.403","volume":"9","author":"L.L. Barros","year":"1988","unstructured":"Barros, L.L.: The optimisation of repair decisions using life-cycle cost parameters. IMA J. Management Math.\u00a09, 403\u2013413 (1988)","journal-title":"IMA J. Management Math."},{"key":"46_CR5","unstructured":"Barros, L.L.: Private communications with M. Tso (2001)"},{"key":"46_CR6","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/S0377-2217(00)00221-6","volume":"129","author":"L.L. Barros","year":"2001","unstructured":"Barros, L.L., Riley, M.: A combinatorial approach to level of repair analysis. Europ. J. Oper. Res.\u00a0129, 242\u2013251 (2001)","journal-title":"Europ. J. Oper. Res."},{"key":"46_CR7","unstructured":"Brightwell, G.: Private communications with G. Gutin (January 2005)"},{"key":"46_CR8","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"46_CR9","unstructured":"Crabtree, J.W., Sandel, B.C.: Army level of repair analysis (LORA). Logistics Spectrum, 27\u201331 (Summer 1989)"},{"key":"46_CR10","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s004939970003","volume":"19","author":"T. Feder","year":"1999","unstructured":"Feder, T., Hell, P., Huang, J.: List homomorphisms and circular arc graphs. Combinatorica\u00a019, 487\u2013505 (1999)","journal-title":"Combinatorica"},{"key":"46_CR11","unstructured":"Frahling, G., Faigle, U.: Combinatorial algorithm for weighted stable sets in bipartite graphs. To appear in Discrete Appl. Math."},{"key":"46_CR12","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman and Co., San Francisco (1979)"},{"key":"46_CR13","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001","volume-title":"Graphs and Homomorphisms","author":"P. Hell","year":"2004","unstructured":"Hell, P., Nesetril, J.: Graphs and Homomorphisms. Oxford University Press, Oxford (2004)"},{"key":"46_CR14","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1287\/mnsc.1040.0242","volume":"50","author":"D. Hochbaum","year":"2004","unstructured":"Hochbaum, D.: Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today. Management Sci.\u00a050, 709\u2013723 (2004)","journal-title":"Management Sci."},{"key":"46_CR15","volume-title":"Introduction to Graph Theory","author":"D. West","year":"1996","unstructured":"West, D.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (1996)"},{"key":"46_CR16","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/0403037","volume":"3","author":"C.-Q. Zhang","year":"1990","unstructured":"Zhang, C.-Q.: Finding critical independent sets and critical vertex subsets are polynomial problems. SIAM J. Discrete Math.\u00a03, 431\u2013438 (1990)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Applications in Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496199_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:40:01Z","timestamp":1619491201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496199_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262244","9783540324409"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11496199_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}