{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T09:08:15Z","timestamp":1726304895113},"publisher-location":"Cham","reference-count":0,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319046563"},{"type":"electronic","value":"9783319046570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04657-0_14","type":"book-chapter","created":{"date-parts":[[2014,1,17]],"date-time":"2014-01-17T05:19:32Z","timestamp":1389935972000},"page":"125-137","source":"Crossref","is-referenced-by-count":11,"title":["Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity"],"prefix":"10.1007","author":[{"given":"Yuya","family":"Higashikawa","sequence":"first","affiliation":[]},{"given":"Mordecai J.","family":"Golin","sequence":"additional","affiliation":[]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[]}],"member":"297","container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04657-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2014,1,17]],"date-time":"2014-01-17T05:19:38Z","timestamp":1389935978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04657-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319046563","9783319046570"],"references-count":0,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04657-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}