{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T10:39:42Z","timestamp":1648895982387},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,12,31]],"date-time":"2008-12-31T00:00:00Z","timestamp":1230681600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s10878-008-9202-9","type":"journal-article","created":{"date-parts":[[2009,1,5]],"date-time":"2009-01-05T15:06:14Z","timestamp":1231167974000},"page":"180-193","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms and time complexity of the request-service problem"],"prefix":"10.1007","volume":"20","author":[{"given":"Chunmei","family":"Liu","sequence":"first","affiliation":[]},{"given":"Legand","family":"Burge","sequence":"additional","affiliation":[]},{"given":"Ajoni","family":"Blake","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,12,31]]},"reference":[{"key":"9202_CR1","doi-asserted-by":"crossref","unstructured":"Abraham D, Blum A, Sandholm T (2007) Clearing algorithms for barter-exchange markets: enabling nationwide kidney exchanges. In: Proceedings of ACM-EC 2007: the eighth ACM conference on electronic commerce","DOI":"10.1145\/1250910.1250954"},{"key":"9202_CR2","doi-asserted-by":"crossref","unstructured":"Castro M, Druschel P, Ganesh A, Rowstron A, Wallach DS (2002) Security for structured peer-to-peer overlay networks. In: Proceedings of OSDI 2002, Boston, MA","DOI":"10.1145\/1060289.1060317"},{"key":"9202_CR3","doi-asserted-by":"crossref","unstructured":"Cooper BF, Garcia-Molina H (2002) Bidding for storage space in a peer-to-peer data preservation system. In: Proceedings of 22nd international conference on distributed computing systems, Vienna, Austria, July 2002","DOI":"10.1109\/ICDCS.2002.1022275"},{"key":"9202_CR4","doi-asserted-by":"crossref","first-page":"1812","DOI":"10.1056\/NEJMp038228","volume":"350","author":"FL Delmonico","year":"2004","unstructured":"Delmonico FL (2004) Exchanging kidneys-advances in living-donor transplantation. New Engl J Med 350:1812\u20131814","journal-title":"New Engl J Med"},{"key":"9202_CR5","doi-asserted-by":"crossref","unstructured":"Druschel P, Rowstron A (2001) PAST: a large-scale, persistent peer-to-peer storage utility. In: Proceedings of 8th workshop on hot topics in operating systems, Schoss Elmau, Germany, May 2001","DOI":"10.1109\/HOTOS.2001.990064"},{"issue":"8","key":"9202_CR6","doi-asserted-by":"crossref","first-page":"1914","DOI":"10.1111\/j.1600-6143.2005.00964.x","volume":"5","author":"SE Gentry","year":"2005","unstructured":"Gentry SE, Segev DL, Montgomery RA (2005) A comparison of populations served by kidney paired donation and list paired donation. Am J Transp 5(8):1914\u20131921","journal-title":"Am J Transp"},{"key":"9202_CR7","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn HW (1955) The Hungarian Method for the assignment problem. Nav Res Logist Q 2:83\u201397","journal-title":"Nav Res Logist Q"},{"key":"9202_CR8","unstructured":"Manthey B (2005) Approximability of cycle covers and smoothed analysis of binary search trees. Dissertation, Universitat zu L\u00fcbeck, Technisch-Naturwissenschaftliche Fakultat, Institut f\u00fcr Theoretische Informatik, December 2005"},{"key":"9202_CR9","doi-asserted-by":"crossref","unstructured":"Ngan T-W, Wallach DS, Druschel P (2003) Enforcing fair sharing of peer-to-peer resources. In: 2nd international workshop on peer-to-peer systems (IPTPS)","DOI":"10.1007\/978-3-540-45172-3_14"},{"key":"9202_CR10","volume-title":"Computational complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou CH (1994) Computational complexity. Addison-Wesley, Reading"},{"issue":"15","key":"9202_CR11","first-page":"1883","volume":"293","author":"DL Segev","year":"2005","unstructured":"Segev DL, Gentry SE, Warren DS, Reeb B, Montgomery RA (2005) Kidney paired donation and optimizing the use of live donor organs. J AMA 293(15):1883\u20131890","journal-title":"J AMA"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9202-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-008-9202-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9202-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:13Z","timestamp":1559261893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-008-9202-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,31]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["9202"],"URL":"https:\/\/doi.org\/10.1007\/s10878-008-9202-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,31]]}}}