{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:43:54Z","timestamp":1725637434240},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258695"},{"type":"electronic","value":"9783642258701"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25870-1_10","type":"book-chapter","created":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T08:32:45Z","timestamp":1322641965000},"page":"95-106","source":"Crossref","is-referenced-by-count":0,"title":["Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses"],"prefix":"10.1007","author":[{"given":"Katar\u00edna","family":"Cechl\u00e1rov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eva","family":"Jel\u00ednkov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, D., Blum, A., Sandholm, T.: Clearing algorithms for barter exchange markets: Enabling nationwide kidney exchanges. In: EC 2007, San Diego, California (2007)","DOI":"10.1145\/1250910.1250954"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-30551-4_3","volume-title":"Algorithms and Computation","author":"D.J. Abraham","year":"2004","unstructured":"Abraham, D.J., Cechl\u00e1rov\u00e1, K., Manlove, D.F., Mehlhorn, K.: Pareto Optimality in House Allocation Problems. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 3\u201315. Springer, Heidelberg (2004)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/CCC.2009.38","volume-title":"CCC 2009: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity","author":"P. Austrin","year":"2009","unstructured":"Austrin, P., Khot, S., Safra, M.: Inapproximability of vertex cover and independent set in bounded degree graphs. In: CCC 2009: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity, pp. 74\u201380. IEEE Computer Society, Washington, DC, USA (2009)"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00453-009-9347-7","volume":"58","author":"K. Cechl\u00e1rov\u00e1","year":"2010","unstructured":"Cechl\u00e1rov\u00e1, K., Fleiner, T.: Housing markets through graphs. Algorithmica\u00a058(1), 19\u201333 (2010)","journal-title":"Algorithmica"},{"issue":"13","key":"10_CR5","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/j.ipl.2011.04.005","volume":"111","author":"K. Cechl\u00e1rov\u00e1","year":"2011","unstructured":"Cechl\u00e1rov\u00e1, K., Jel\u00ednkov\u00e1, E.: An efficient implementation of the equilibrium algorithm for housing markets with duplicate houses. Information Processing Letters\u00a0111(13), 667\u2013670 (2011)","journal-title":"Information Processing Letters"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-17493-3_9","volume-title":"Parameterized and Exact Computation","author":"K. Cechl\u00e1rov\u00e1","year":"2010","unstructured":"Cechl\u00e1rov\u00e1, K., Schlotter, I.: Computing the Deficiency of Housing Markets with Duplicate Houses. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol.\u00a06478, pp. 72\u201383. Springer, Heidelberg (2010)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0022-0000(03)00011-4","volume":"67","author":"X. Deng","year":"2003","unstructured":"Deng, X., Papadimitriou, C., Safra, S.: On the complexity of price equilibria. J. Computer and System Sciences\u00a067, 311\u2013324 (2003)","journal-title":"J. Computer and System Sciences"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I. Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics\u00a0162, 439\u2013485 (2005)","journal-title":"Annals of Mathematics"},{"issue":"5","key":"10_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.ipl.2003.08.008","volume":"88","author":"S. Fekete","year":"2003","unstructured":"Fekete, S., Skutella, M., Woeginger, G.: The complexity of economic equilibria for house allocation markets. Information Processing Letters\u00a088(5), 219\u2013223 (2003)","journal-title":"Information Processing Letters"},{"issue":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/1273340.1273346","volume":"3","author":"M.M. Halld\u00f3rsson","year":"2007","unstructured":"Halld\u00f3rsson, M.M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Improved approximation results for the stable marriage problem. ACM Trans. Algorithms\u00a03(3), 30 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proc. 34th ACM Symp. on Theory of Computing, STOC 2002, pp. 767\u2013775 (2002)","DOI":"10.1145\/510014.510017"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S. Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2\u2009\u2212\u2009\u03b5. Journal of Computer and System Sciences\u00a074(3), 335\u2013349 (2008); Computational Complexity 2003","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-4068(74)90033-0","volume":"1","author":"L. Shapley","year":"1974","unstructured":"Shapley, L., Scarf, H.: On cores and indivisibility. J. Math. Econ.\u00a01, 23\u201337 (1974)","journal-title":"J. Math. Econ."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25870-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T00:04:47Z","timestamp":1560989087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25870-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258695","9783642258701"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25870-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}