{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T03:24:06Z","timestamp":1773631446591,"version":"3.50.1"},"publisher-location":"Providence, Rhode\n                    Island","reference-count":0,"publisher":"American Mathematical\n                    Society","isbn-type":[{"value":"9780821865989","type":"print"},{"value":"9781470439705","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993,10,1]]},"DOI":"10.1090\/dimacs\/012\/17","type":"book-chapter","created":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T22:31:57Z","timestamp":1493245917000},"page":"431-451","source":"Crossref","is-referenced-by-count":9,"title":["An approximate dual projective algorithm for\n                    solving assignment problems"],"prefix":"10.1090","author":[{"given":"K","family":"Ramakrishnan","sequence":"first","affiliation":[]},{"given":"Narendra","family":"Karmarkar","sequence":"additional","affiliation":[]},{"given":"A","family":"Kamath","sequence":"additional","affiliation":[]}],"member":"14","container-title":["DIMACS Series in Discrete Mathematics and\n                        Theoretical Computer Science","Network Flows and Matching: First DIMACS\n                    Implementation Challenge"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T02:24:28Z","timestamp":1773627868000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/dimacs\/012\/17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10,1]]},"ISBN":["9780821865989","9781470439705"],"references-count":0,"URL":"https:\/\/doi.org\/10.1090\/dimacs\/012\/17","relation":{},"ISSN":["1052-1798","2472-4793"],"issn-type":[{"value":"1052-1798","type":"print"},{"value":"2472-4793","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,10,1]]}}}