{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T01:51:20Z","timestamp":1775440280418,"version":"3.50.1"},"publisher-location":"Providence, Rhode Island","reference-count":0,"publisher":"American Mathematical Society","isbn-type":[{"value":"9780821865989","type":"print"},{"value":"9780821870594","type":"print"},{"value":"9781470439705","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993,10,1]]},"DOI":"10.1090\/dimacs\/012\/07","type":"book-chapter","created":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T22:31:57Z","timestamp":1493245917000},"page":"157-198","source":"Crossref","is-referenced-by-count":12,"title":["On implementing scaling push-relabel algorithms for the minimum-relabel algorithms for the minimum-cost flow problem"],"prefix":"10.1090","author":[{"given":"Andrew","family":"Goldberg","sequence":"first","affiliation":[]},{"given":"M","family":"Kharitonov","sequence":"additional","affiliation":[]}],"member":"14","container-title":["DIMACS Series in Discrete Mathematics and Theoretical Computer Science","Network Flows and Matching: First DIMACS Implementation Challenge"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T00:54:59Z","timestamp":1775436899000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.ams.org\/dimacs\/012"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10,1]]},"ISBN":["9780821865989","9780821870594","9781470439705"],"references-count":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1090\/dimacs\/012\/07","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]]}}}