{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:41:21Z","timestamp":1725486081571},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410539"},{"type":"electronic","value":"9783540453499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45349-0_47","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T00:54:55Z","timestamp":1181177695000},"page":"549-553","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions"],"prefix":"10.1007","author":[{"given":"Yuko","family":"Sakurai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"Yokoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koji","family":"Kamei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"47_CR1","unstructured":"Fujishima, Y., Leyton-Brown, K., and Shoham, Y.: Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches. IJCAI-99 (1999)"},{"key":"47_CR2","unstructured":"Harvey, W. D. and Ginsberg, M. L.: Limited Discrepancy Search. IJCAI-95 (1995)"},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0004-3702(93)90045-D","volume":"62","author":"R. E. Korf","year":"1993","unstructured":"Korf, R. E.: Depth-first iterative deepening: an optimal admissible tree search. Artificial Intelligence\n                           62 (1993) 43\u201378","journal-title":"Artificial Intelligence"},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"M. H. Rothkopf","year":"1998","unstructured":"Rothkopf, M. H., Peke\u010d, A., and Harstad, R. M.: Computationally Manageable Combinatorial Auctions. Management Science\n                           44 (1998) 1131\u20131147","journal-title":"Management Science"},{"key":"47_CR5","unstructured":"Sandholm, T.: An Algorithm for Optimal Winner Determination in Combinatorial Auction. IJCAI-99 (1999)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45349-0_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T05:53:23Z","timestamp":1550382803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45349-0_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410539","9783540453499"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-45349-0_47","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}