{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:30:42Z","timestamp":1767339042249},"reference-count":15,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1137\/s009753979732253x","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T15:12:06Z","timestamp":1055344326000},"page":"761-778","source":"Crossref","is-referenced-by-count":85,"title":["A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees"],"prefix":"10.1137","volume":"29","author":[{"given":"Bang Ye","family":"Wu","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Lancia","sequence":"additional","affiliation":[]},{"given":"Vineet","family":"Bafna","sequence":"additional","affiliation":[]},{"given":"Kun-Mao","family":"Chao","sequence":"additional","affiliation":[]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[]},{"given":"Chuan Yi","family":"Tang","sequence":"additional","affiliation":[]}],"member":"351","reference":[{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1137\/0148063"},{"key":"R7","volume-title":"Introduction to algorithms","author":"Manber Udi","year":"1989"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02603120"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02460299"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/0203015"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230080402"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.86.12.4412"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1137\/0152101"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009336"},{"key":"R17","volume-title":"Time warps, string edits, and macromolecules: the theory and practice of sequence comparison","author":"Sankoff David","year":"1983"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1038\/245232a0"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1002\/prot.340090304"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1994.1.337"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1137\/0601008"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S009753979732253X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,29]],"date-time":"2017-01-29T16:38:14Z","timestamp":1485707894000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/S009753979732253X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["10.1137\/S009753979732253X"],"URL":"https:\/\/doi.org\/10.1137\/s009753979732253x","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}